Manpower Planning with Annualized Hours Flexibility: A Fuzzy Mathematical Programming Approach
Journal Title: Decision Making in Manufacturing and Services - Year 2016, Vol 10, Issue 1
Abstract
We have considered the problem of annualized hours (AH) in workforce management. AH is a method of distributing working hours with respect to the demand over a year. In this paper, the basic Manpower planning problem with AH flexibility is formulated as a fuzzy mathematical programming problem with flexible constraints. Three models of the AH planning problem under conditions of fuzzy uncertainty are presented using different aggregation operators. These fuzzy models soften the rigidity of the deterministic model by relaxing some constraints with the use of flexible programming. Finally, an illustration is given with a computational experiment performed on a realistic-scale case problem of an automobile company to demonstrate and analyze the effectiveness of the fuzzy approach over a deterministic model.
Authors and Affiliations
Md. Gulzarull Hasan, S. Suhaib Hasan
Keywords
Related Articles
- EP ID EP413400
- DOI 10.7494/dmms.2016.10.1-2.5
- Views 83
- Downloads 0
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor’s pe...
Batch Scheduling of Deteriorating Products
In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waitin...
Corrigendum to ”Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources”
Amendment to [Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 5–17
Coordinating Contracts in SCM: A Review of Methods and Literature
Supply chain coordination through contracts has been a burgeoning area of re- search in recent years. In spite of rapid development of research, there are only a few structured analyses of assumptions, methods, and appli...
Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times
The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unkno...