Global Search Method for Parallel Machine Scheduling

Authors:
Hyun Joon Shin
Affiliations:
Department of Industrial Information and Systems Engineering, Sangmyung University, Cheonan-si, Choongnam, 330-720, Korea
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 3
Cited 0

Fast Global Optimization of Difficult Lennard-Jones Clusters

Computational Optimization and Applications
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
Progressive Refinement of Raster Images

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a guided multi-restart search (GMRS) algorithm for scheduling parallel machines in terms of global optimum. GMRS consists of a strategic guided local search phase and a phase that generates a beneficial restart point using the information acquired during the local search. The experimental results show that the proposed algorithm considerably improves the solution within a reasonable time.