Minimizing Makespan in a Flow Shop with Two Batch Machines
被引:0
作者:
Huang, Jin-dian
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
Jieyang Vocat & Tech Coll, Dept Mech & Elect Engn, Jieyang, Peoples R ChinaGuangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
Huang, Jin-dian
[1
,2
]
Liu, Jian-jun
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R ChinaGuangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
Liu, Jian-jun
[1
]
Chen, Qing-xin
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R ChinaGuangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
Chen, Qing-xin
[1
]
Mao, Ning
论文数: 0引用数: 0
h-index: 0
机构:
Guangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R ChinaGuangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
Mao, Ning
[1
]
机构:
[1] Guangdong Univ Technol, Dept Electromech Engn, Guangzhou, Guangdong, Peoples R China
[2] Jieyang Vocat & Tech Coll, Dept Mech & Elect Engn, Jieyang, Peoples R China
来源:
PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT: CORE THEORY AND APPLICATIONS OF INDUSTRIAL ENGINEERING (VOL 1)
|
2016年
On the background of the heat-treatment operation in the mould manufacturers, a flow shop scheduling problem is described to minimize makespan with two batch machines. The jobs differ from each other in weights and due-dates. An improved mixed integer linear programming (MILP) model is developed. A heuristic is proposed to improve the computing efficiency of the improved MILP model. A small-size instance is conducted to validate the optimal solution can be obtained by the improved MILP model. Large-size instances are designed to demonstrate the computing efficiency of the improved MILP model and the heuristic.