Abstract
We address the two-machine flowshop scheduling problem to minimize makespan where jobs have random and bounded processing times. The probability distributions of job processing times are unknown and only the lower and upper bounds of processing times are given before scheduling. In such cases there may not exist a unique schedule that remains optimal for all possible realizations of processing times, and therefore, a set of schedules has to be considered which dominates all other schedules. In this paper, we find some sufficient conditions for the considered problem.
| Original language | English |
|---|---|
| Pages (from-to) | 65-76 |
| Number of pages | 12 |
| Journal | International Transactions in Operational Research |
| Volume | 10 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2003 |
Keywords
- Flowshop
- Makespan
- Random processing times
- Scheduling
Fingerprint
Dive into the research topics of 'Two-machine flowshop minimum-length scheduling problem with random and bounded processing times'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver