Szczegóły

Tytuł artykułu

Permutation, no-wait, no-idle flow shop problems

Tytuł czasopisma

Archives of Control Sciences

Rocznik

2015

Numer

No 2

Autorzy publikacji

Wydział PAN

Nauki Techniczne

Abstrakt

<jats:title>Abstract</jats:title> <jats:p>The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.</jats:p>

Wydawca

Committee of Automatic Control and Robotics PAS

Data

2015[2015.01.01 AD - 2015.12.31 AD]

Identyfikator

ISSN 1230-2384

Referencje

Nawaz (1983), EnscoreJrand A heuristic algorithm for the m - machine job flow - shop sequencing problem The of, Management Science, 11, 91. ; Sviridenko (2003), Makespan minimization in no - wait flow shops : A polynomial time approximation scheme on, Discrete Mathematics, 16, 313. ; Röck (1984), The three - machine no - wait flow shop is NP - complete of Association for, Computing Machinery, 31, 336, doi.org/10.1145/62.65 ; Woeginger (2005), Spieksmaand The no - wait flow - shop paradox Operations, Research Letters, 33, 603. ; Graham (1979), Lenstraand Optimization and approximation in deterministic sequencing and scheduling : a survey Annals of Discrete, Mathematics, 5, 287.

DOI

10.1515/acsc-2015-0012

×