JIT single machine scheduling problem with periodic preventive maintenance

Artikel

This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, multi-objective particle swarm optimization (MOPSO) algorithm is implemented. Also, as well as MOPSO, two other optimization algorithms are used for comparing the results. Eventually, Taguchi method with metrics analysis is presented to tune the algorithms' parameters and a multiple criterion decision making technique based on the technique for order of preference by similarity to ideal solution is applied to choose the best algorithm. Comparison results confirmed the supremacy of MOPSO to the other algorithms.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 12 ; Year: 2016 ; Pages: 299-310 ; Heidelberg: Springer

Classification and Topics

• Classification: Management
• Subject: Scheduling ; Single machine ; Periodic maintenance ; Total earliness-tardiness ; Multi-objective optimization ; MCDM

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Shahriari, Mohammadreza ; Shoja, Naghi ; Zade, Amir Ebrahimi ; Barak, Sasan ; Sharifi, Mani
• Event: Veröffentlichung
• (who): Springer
• (where): Heidelberg
• (when): 2016

Further information

• DOI: doi:10.1007/s40092-016-0147-9
• Handle: http://hdl.handle.net/10419/157493
• Last update: 10.03.2025, 11:42 AM CET