Scheduling with day shifts and breaks

Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor‐intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International transactions in operational research Jg. 28; H. 2; S. 598 - 614
Hauptverfasser: Xu, Dehua, Xu, Limin, Yu, Xianyu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.03.2021
Schlagworte:
Algorithms
bin packing
day shift
Genetic algorithms
heuristic algorithm
Integer programming
noon break
Operations research
Production scheduling
Scheduling
Spraying
ISSN:0969-6016, 1475-3995
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor‐intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines and in the paint‐spraying stage of wooden furniture, we consider a scheduling problem with day shifts and breaks. We transform the problem into a new bin‐packing problem and present some theoretical analyses. To meet the needs of practical applications, we propose a binary integer programming (BIP) formulation and a hybrid genetic algorithm (HGA) that is based on five heuristic algorithms and two postoptimization procedures. Computational results indicate that the BIP formulation is suitable for some data sets while the HGA is the most promising in that it saves about 37% of day shifts compared to the best of the five heuristic algorithms in the context of scheduling.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.12855