Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times (Q1415102)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times |
scientific article |
Statements
Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times (English)
0 references
3 December 2003
0 references
Summary: 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.
0 references
