文章基本信息

标题：Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
本地全文：下载
作者：Ali Allahverdi ; Tariq Aldowaisan ; Yuri N. Sotskov 等
期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2003
卷号：2003
DOI：10.1155/S016117120321019X
出版社：Hindawi Publishing Corporation
摘要：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.