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 85
- Downloads 0
Partial Coordination May Increase Overall Costs in Supply Chains
This paper presents a computational study to evaluate the impact of coordinating production and distribution planning in a two-level industrial supply chain. Three planning methods are compared. The first emulates the tr...
On Public Values and Power Indices
In this paper we analyze, from a different point of view, some values and power indices well defined in the social context where the goods are public. In particular we consider the Public Good index (Holler, 1982), the P...
Concept of Industry 4.0-Related Manufacturing Technology Maturity Model (ManuTech Maturity Model – MTMM)
The main objective of this article is to describe Industry 4.0 and key manufacturing-technology-related technological and business challenges for manufacturing companies. The groups especially interested in the industry...
Interval methods for computing strong Nash equilibria of continuous games
The problem of seeking strong Nash equilibria of a continuous game is considered. For some games these points cannot be found analytically, only numerically. Interval methods provide us an approach to rigorously verify t...
A Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies
The paper deals with the problem of optimal configuration of a type of transfer lines which are equipped with transfer machines. Such machines perform operations with standard modular spindle heads which are activated se...