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

International Journal of Mathematics and Mathematical Sciences, 2003, vol. 2003, 1-12

Abstract:

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.

Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2003/156046.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2003/156046.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:156046

DOI: 10.1155/S016117120321019X

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().