Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 58, Issue 1, Pages 165-174Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2009.10.003
Keywords
Scheduling; Parallel dedicated machines; Single server; Sequence-dependent setups
Funding
- National Science Foundation of China [70771055]
- Specialized Research Fund
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available