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 74
- Downloads 0
The Errors-in-Variable Model in the Optimal Portfolio Construction
In the paper we consider a modification of Sharpe’s method used in classical portfolio analysis for optimal portfolio building. The conventional theory assumes there is a linear relationship between asset’s return and ma...
Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs
We consider mixed-integer linear programming (MIP) models of production planning problems known as the small bucket lot-sizing and scheduling problems. We present an application of a class of valid inequalities to the ca...
Hyperbolicity of systems describing value functions in differential games which model duopoly problems
Based on the Bressan and Shen approach ([2] or [7]), we present the extension of the class of non-zero sum dierential games for which value functions are described by a weakly hyperbolic Hamilton-Jacobi system. The consi...
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual excl...
CP-driven Production Process Planning in Multiproject Environment
The way enterprise capabilities are used decides about its competitiveness among other ones. In that context modeling aimed at production tasks allocation planning plays a crucial role especially at concurrently executed...