A heuristic algorithm for the scheduling problem of parallel machines with mold constraints

被引：0
|
作者：
Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan [1 ]
不详 [2 ]
不详 [3 ]
机构：
来源：
WSEAS Trans. Syst. | 2008年 / 6卷 / 642-651期
关键词：
Computational complexity - Job shop scheduling - Scheduling algorithms - Molds;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper addresses the scheduling problem of parallel machines with mold constraints. Each machine has to load one kind of molds to process a specific job in the production environment. Because it takes lots of time to change one mold to another on a same machine for producing jobs with different types, it will be efficient to put all similar jobs together as a batch production. This way will, however, result in the total tardiness of jobs increasing due to the different due dates of jobs. This kind of problems is an NP-hard problem. In this paper, we build a model to describe the problem and present a heuristic algorithm to solve it.
引用
收藏
相关论文
共 50 条
12345