Year: 2006
Type: article
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.
Authors: Jean‐Paul Arnaout, Ghaith Rabadi, Ji Hyon Mun
Institution: Old Dominion University
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2124154451