two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times两flowshop调度问题和随机时间或总完工时间和有限的设置时间.pdf

IJMMS 2003:39, 2475–2486 PII. S016117120321019X © Hindawi Publishing Corp. TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN OR TOTAL COMPLETION TIME WITH RANDOM AND BOUNDED SETUP TIMES ALI ALLAHVERDI, TARIQ ALDOWAISAN, and YURI N. SOTSKOV Received 21 October 2002 This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given. 2000 Mathematics Subject Classification: 90B36, 90B35, 90B30. 1. Introduction. The two-machine flowshop scheduling problem is polyno- mially solvable when the objective is to minimize makespan, see [ 7]. The prob- lem, however, is proven to be NP-hard when the performance measure is total completion time (TCT), see [6]. In these and the vast majority of subsequent research on the flowshop problems, it is assumed that either the setup time for a job is included in its processing time or the setup times are zero on each machine. While these assumptions may be justified for some real scheduling problems, other situations call for explicit (separate) setup time consideration. The practical situations in which setup times must be considered as separate include the chemical, pharmaceutical, printing, food processing, metal pro- cessing, and semiconductor industries, see [3] for a survey on the scheduling problems with separate setup times. An obvious advantage of considering setup times separate is that when there exists idle time o