期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 58, 期 1, 页码 165-174出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.10.003
关键词
Scheduling; Parallel dedicated machines; Single server; Sequence-dependent setups
资金
- National Science Foundation of China [70771055]
- Specialized Research Fund
This paper addresses a scheduling problem on parallel dedicated machines in which the setup times are sequence-dependent and the setup operations are performed by a single server. The objective of the problem is to minimize the makespan of the system. The problem is formulated as an integer program and the lower bounds are constructed. A special case of the problem is presented and solved in polynomial time. For the general cases, a hybrid genetic algorithm is developed to solve the problem. The algorithm is tested by both randomly generated data sets and real-world data sets from a printing industry. The computational results show that the algorithm is efficient and effective for both types of data sets. (C) 2009 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据