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 82
- Downloads 0
On Efficient Coloring of Chordless Graphs
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff a graph obtained by joining e to path P (cycle C) has exactly two vertices of degree 3. A class of graphs without any ch...
Game-Theoretic Approach to Bank Loan Repayment
The paper presents a model of a bank loan repayment as a signaling game with a set of discrete types of borrowers. The type of the borrower is the return on investment project. A possibility of renegotiation of the loan...
Scheduling with High Variety of Customized Compound Products
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety...
Ant Algorithm for AP-N Aimed at Optimization of Complex Systems
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions an...
Very Fast Non-Dominated Sorting
New and very ecient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup...