Scheduling with day shifts and breaks.
作者：
Xu, Dehua;Xu, Limin;Yu, Xianyu
作者机构：
Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, Nanjing 211106, Peoples R China.
Nanjing Univ Finance & Econ, Sch Int Econ & Business, Nanjing 210023, Peoples R China.
语种：
英文
关键词：
scheduling;day shift;noon break;bin packing;heuristic algorithm
期刊：
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
ISSN：
0969-6016
年：
2021
卷：
28
期：
2
页码：
598-614
基金类别：
Qinglan Project of Universities in Jiangsu; National Natural Science Foundation of ChinaNational Natural Science Foundation of China [71774080]
摘要：
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.
