Flowshop and Extensions

Finke, Gerd; Espinouse, Marie‐Laure; Jiang, Houmin

doi:10.1016/s1474-6670(17)42304-4

Cited by 2 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where m is the number of machines, even if the buffer storage is limited (Röck, 1980). Moreover, if the no-wait constraint is restricted to a sub-set of jobs then, the problem remains NP-hard in the strong sense (Finke et al 1997). The m-machine no-wait flowshop scheduling problem with the aim of minimizing the makespan and the total completion time was studied in Allahverdi and Aldowaisan (2002).…”

Section: Introductionmentioning

confidence: 99%

No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates

Chihaoui¹,

Kacem²,

Hadj-Alouane³

et al. 2011

International Journal of Production Research

View full text Add to dashboard Cite

In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The nonavailability intervals of the machines overlap and they are known in advance. We aim to find a nonresumable schedule that minimizes the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.

show abstract

Section: Introductionmentioning

confidence: 99%

No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates

Chihaoui¹,

Kacem²,

Hadj-Alouane³

et al. 2011

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…For the two machines problem, the Johnson Rule provides the optimum solution in polynomial time. However, the problem becomes NP-hard in strong sense when limited bu er is considered between machines (Papadimitriou and Kannelakis [13]), or some of jobs are no-wait type (Finke et al [14]). Similarly, Gupta [15] proves that the problem of minimizing makespan for two-stage owshop is NP-complete when there is one machine in the ÿrst stage and two (or more) parallel identical machines in the second stage.…”

Section: Introductionmentioning

confidence: 99%