Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic

Authors:
Kuo-Ching Ying;Hui-Miao Cheng
Affiliations:
Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan, ROC;Department of Information Management, China University of Technology, Taipei, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 5
Cited 5

Multiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system

Expert Systems with Applications: An International Journal
Raising the hit rate for wafer fabrication by a simple constructive heuristic

Expert Systems with Applications: An International Journal
Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic

Expert Systems with Applications: An International Journal
Two-phase sub population genetic algorithm for parallel machine-scheduling problem

Expert Systems with Applications: An International Journal
NP-complete scheduling problems

Journal of Computer and System Sciences

Integrating parts design characteristics and scheduling on parallel machines

Expert Systems with Applications: An International Journal
A GRASP approach to transporter scheduling and routing at a shipyard

Computers and Industrial Engineering
Minimizing makespan in a flow-line manufacturing cell with sequence dependent family setup times

Expert Systems with Applications: An International Journal
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Computers and Operations Research
An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	12.05

Visualization

Abstract

Topics related to parallel machine scheduling problems have been of continuing interest for researchers and practitioners. However, the dynamic parallel machine scheduling problem with sequence-dependent setup times still remains under-represented in the research literature. In this study, an iterated greedy heuristic for this problem is presented. Extensive computational experiments reveal that the proposed heuristic is highly effective as compared to state-of-the-art algorithms on the same benchmark problem data set.