𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reentrant two-stage multiprocessor flow shop scheduling with due windows

✍ Scribed by Huang, Rong-Hwa; Yu, Shun-Chi; Kuo, Chen-Wei


Book ID
121541701
Publisher
Springer
Year
2014
Tongue
English
Weight
283 KB
Volume
71
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Preemptive scheduling in a two-stage mul
✍ J.A. Hoogeveen; J.K. Lenstra; B. Veltman πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 352 KB

In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine flow shop; there is no advantage to preemption in this case. McNaughton's wrap-around rule of 1959 finds a shortest preemptive schedule on identical parallel machines in linear time. A similarly efficient algorithm