Document Type
Article
Publication Date
2006
Publication Title
International Journal of Operations Research
Volume
3
Issue
2
Pages
136-143
Abstract
This paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the total weighted mean completion time. The jobs' processing times and setup times are stochastic for better depiction of the real world. This is a NP-hard problem and in this paper, new heuristics are developed and compared to existing ones using simulation. The results and analysis obtained from the computational experiments proved the superiority of the proposed algorithm PMWP over the other algorithms presented.
ORCID
0000-0003-1590-4494 (Arnaout), 0000-0001-8145-313X (Rabadi)
Original Publication Citation
Arnaout, J.-P., Rabadi, G., & Mun, J. H. (2006). A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem. International Journal of Operations Research, 3(2), 136-143.
Repository Citation
Arnaout, Jean-Paul; Rabadi, Ghaith; and Mun, Ji Hyon, "A Dynamic Heuristic for the Stochastic Unrelated Parallel Machine Scheduling Problem" (2006). Engineering Management & Systems Engineering Faculty Publications. 33.
https://digitalcommons.odu.edu/emse_fac_pubs/33
Comments
Published under a Creative Commons Attribution License 4.0 (CC BY 4.0)
https://creativecommons.org/licenses/by/4.0/