IN PRESS                   Back to the articles list | Back to browse issues page

XML Print

Non-Identical Parallel Machine Scheduling Problem with Worker Fatigue Consideration
Achmad Pratama Rifai1 , Suma Samala Jiwangga2 , Andri Nasution3
1- Department of Mechanical and Industrial Engineering, Faculty of Engineering, Universitas Gadjah Mada, Special Region of Yogyakarta, 55284, Indonesia , achmad.p.rifai@ugm.ac.id
2- Department of Mechanical and Industrial Engineering, Faculty of Engineering, Universitas Gadjah Mada, Special Region of Yogyakarta, 55284, Indonesia
3- Department of Industrial Engineering, Faculty of Engineering, Universitas Sumatera Utara, Medan, Indonesia
Abstract:   (39 Views)
Machine scheduling critically influences production efficiency. This study focuses on the Non-Identical Parallel Machine Scheduling Problem (NIPMSP) and explicitly incorporates human factors, namely worker fatigue, into an exact optimization framework. A mixed-integer nonlinear programming (MINLP) model where fatigue accumulation and recovery dynamically affect processing times. The model is verified and validated using secondary datasets and manual calculations, and solved with Gurobi across multiple configurations (2–3 machines; 6–20 jobs). Results show that the model consistently produces feasible solutions; higher fatigue rates increase makespan, whereas higher recovery rates reduce it. Sensitivity analyses on the fatigue rate, recovery rate, and percentage of jobs influenced by fatigue further confirm these trends. Incorporating worker fatigue enables more realistic makespan minimization and provides actionable managerial insights to balance throughput and workforce well-being.
Keywords: Machine scheduling, NIPMSP, worker fatigue, mathematical modelling, makespan
Full-Text [PDF 620 kb]   (63 Downloads)    
Type of Study: Research | Subject: Production Planning & Control
Received: 2025/11/28 | Accepted: 2026/06/2
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.