Total completion time with makespan constraint in no-wait flowshops with setup times

•The multi objective problem with setup times is addressed.•Different algorithms including the most recent ones are proposed.•One of the algorithms performs better than the others, statistically verified.•Algorithms, including the best one in the literature, have the same CPU time.•Best algorithm re...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 238; číslo 3; s. 724 - 734
Hlavní autori: Allahverdi, Ali, Aydilek, Harun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.11.2014
Elsevier Sequoia S.A
Predmet:
Algorithms
Completion time
Computation
Computer simulation
Flowcharts
Genetic algorithms
Insertion
Job shops
Makespan
No-wait flowshop
Operational research
Production scheduling
Scheduling
Setup times
Simulated annealing
Studies
Total completion time
Scheduling
Makespan
No-wait flowshop
Total completion time
Setup times
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•The multi objective problem with setup times is addressed.•Different algorithms including the most recent ones are proposed.•One of the algorithms performs better than the others, statistically verified.•Algorithms, including the best one in the literature, have the same CPU time.•Best algorithm reduces the error of the best one in the literature by at least 90%. The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated as separate from processing times. Several recent algorithms, an insertion algorithm, two genetic algorithms, three simulated annealing algorithms, two cloud theory-based simulated annealing algorithms, and a differential evolution algorithm are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that one of the nine proposed algorithms, one of the simulated annealing algorithms (ISA-2), performs much better than the others under the same computational time. Moreover, the analysis indicates that the algorithm ISA-2 performs significantly better than the earlier existing best algorithm. Specifically, the best performing algorithm, ISA-2, proposed in this paper reduces the error of the existing best algorithm in the literature by at least 90% under the same computational time. All the results have been statistically tested.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2014.04.031