✦ LIBER ✦

Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability

✍ Scribed by M.L. Espinouse; P. Formanowicz; B. Penz

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 307 KB
Volume: 37
Category: Article
ISSN: 0360-8352
DOI: 10.1016/s0360-8352(99)00127-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 advance. The objective function considered is the maximum completion time (Cm~). We prove that the problem is NP-Hard even if only one unavailability period occurs on one single machine, and NP-Hard in the strong sense for arbitrary numbers of unavailability periods. We also provide heuristic algorithms with error bounding analysis.

📜 SIMILAR VOLUMES

Minimizing the makespan in the non-preem

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

✍ Yazid Mati 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Two machine flow shop scheduling problem

Two machine flow shop scheduling problem with no wait in process: controllable machine speeds

✍ Vitaly A. Strusevich 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 723 KB

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

Minimizing total expected costs in the t

Minimizing total expected costs in the two-machine, stochastic flow shop

✍ Frank G Forst 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 368 KB

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.