Scheduling of hybrid types of machines with two-machine flowshop as the first type and a single machine as the second type

2017 International Conference on Sensors, Materials and Manufacturing

工业技术;材料科学;机械制造

Hsiao, Ming-Chih^1 ; Su, Ling-Huey^1

Department of Industrial and Systems Engineering, Chung Yuan Christian University, Taiwan^1

关键词: Computational experiment;    Hybrid machine;    Mixed integer programming (MIP);    Parallel machine;    Production schedule;    Simulated annealing algorithms;    Single- machines;    Two-machine flowshop;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/311/1/012008/pdf
DOI  :  10.1088/1757-899X/311/1/012008

来源: IOP

【 摘 要 】

This research addresses the problem of scheduling hybrid machine types, in which one type is a two-machine flowshop and another type is a single machine. A job is either processed on the two-machine flowshop or on the single machine. The objective is to determine a production schedule for all jobs so as to minimize the makespan. The problem is NP-hard since the two parallel machines problem was proved to be NP-hard. Simulated annealing algorithms are developed to solve the problem optimally. A mixed integer programming (MIP) is developed and used to evaluate the performance for two SAs. Computational experiments demonstrate the efficiency of the simulated annealing algorithms, the quality of the simulated annealing algorithms will also be reported.