𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability

✍ Scribed by Yazid Mati

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
272 KB
Volume
59
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimizing the makespan in the two-machi
Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability
✍ M.L. Espinouse; P. Formanowicz; B. Penz πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 307 KB

This paper deals with the two-machine no-wait flow-shop problem with limited machine availability. In this model, we assume that machines may not always be available, for example because of preventive maintenance. We only consider the deterministic case where the unavailable periods are known in adv

Fast algorithms to minimize the makespan
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
✍ Jinliang Cheng; George Steiner; Paul Stephenson πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 186 KB πŸ‘ 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniΓΏed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound