Makespan minimization for scheduling unrelated parallel machines with setup times

Authors:
Kuo-Ching Ying;Zne-Jung Lee;Shih-Wei Lin
Affiliations:
Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan, ROC;Department of Information Management, Huafan University, Taipei, Taiwan, ROC;Department of Information Management, Chang Gung University, Tao-Yuan, Taiwan, ROC
Venue:
Journal of Intelligent Manufacturing
Year:
2012

Citing 6
Cited 2

Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Theoretical Computer Science
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
Unrelated parallel machine scheduling using local search

Mathematical and Computer Modelling: An International Journal

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

Journal of Intelligent Manufacturing
A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines--part II: enhancements and experimentations

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study considers the problem of scheduling jobs on unrelated parallel machines with machine-dependent and job sequence-dependent setup times. In this study, a restricted simulated annealing (RSA) algorithm which incorporates a restricted search strategy is presented to minimize the makespan. The proposed RSA algorithm can effective reduce the search effort required to find the best neighborhood solution by eliminating ineffective job moves. The effectiveness and efficiency of the proposed RSA algorithm is compared with the basic simulated annealing and existing meta-heuristics on a benchmark problem dataset used in earlier studies. Computational results indicate that the proposed RSA algorithm compares well with the state-of-the-art meta-heuristic for small-sized problems, and significantly outperforms basic simulated annealing algorithm and existing algorithms for large-sized problems.