Batching and Sequencing of Incompatible Job Families for a Single Machine Problem

被引：0

作者：

Omar, Mohamed K. ^{[1
]}

Suppiah, Yasothei ^{[2
]}

机构：

[1] Univ Nottingham, Business Sch Malaysia, Selangor, Malaysia

[2] Multimedia Univ, Fac Engn & Technol, Melaka, Malaysia

来源：

2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013) | 2013年

关键词：

Incompatible families; heuristics; sequence dependent setup times; TOTAL WEIGHTED TARDINESS; NEIGHBORHOOD SEARCH; SETUP TIMES;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper extends the work of Omar and Suppiah [1] and proposes three combinations of heuristics that aim to minimize the total weighted tardiness for batching and sequencing of jobs originated from incompatible families with sequence dependent family setup time to be processed on a single machine. The developed three-combination include EDD-EDD, EDD-BATCS and ATC-BATCS. Computational performance experiments of EDD-EDD, EDD-BATCS and ATC-BATCS using 640 randomly generated instances was studied. The results indicate that the ATC-BATCS has outperformed the other two heuristics in terms of quality of the solution (minimizing total weighted tardiness).

引用

页码：733 / 737

页数：5