Permutation vs. non-permutation flow shop schedules

Operations Research Letters

Volumn 10, Issue 5, 1991, Pages 281-284

  Potts, Chris N ^a   Shmoys, David B ^b   Williamson, David P ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b Department of Obstetrics Gynecology   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

approximation algorithms; flow shop scheduling; permutation schedules

Indexed keywords

EID: 0009693843     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(91)90014-G     Document Type: Article

References (4)

1. A combinatorial problem in geometry
2. Sequencing and scheduling: algorithms and complexity
3. Machine aggregation heuristics in shop scheduling
4. Machine aggregation heuristics in shop-scheduling