Title :
Iterative local search with leap-frog steps for job shop scheduling problems
Author :
Yong Ming Wang ; Hong Li Yin
Author_Institution :
Fac. of Manage. & Econ., Kunming Univ. of Sci. & Technol., Kunming, China
Abstract :
Iterative Local search methods have the characteristic of obtaining decent solution with short or acceptable time for job shop scheduling problems. They improve solution by search iteratively neighbors of initial solution. But they tend to get trapped in local optimal solutions, usually far away from the global optimal solution. Simulated annealing methods try to improve on this by accepting uphill moves depending on a decreasing probability controlled by the temperature parameter. But, at small temperatures, they also tend to get stuck in valleys of the cost function. In this paper, we proposed an iterative local search with leap-frog steps. The leap-frog steps of the iterative local search allow one to leave these valleys even at small temperatures. Experiments on some job shop scheduling benchmark problems demonstrated the effectiveness and efficiency of the iterative local search with leapfrog steps.
Keywords :
iterative methods; job shop scheduling; search problems; simulated annealing; cost function; iterative local search; job shop scheduling problem; leap-frog steps; simulated annealing; temperature parameter; Iterative methods; Job shop scheduling; Optimal scheduling; Processor scheduling; Schedules; Search problems; Simulated annealing; Iterative local search methods; Job shop scheduling; Leap-frog steps; Simulated annealing algorithm;
Conference_Titel :
Mechatronics and Automation (ICMA), 2013 IEEE International Conference on
Conference_Location :
Takamatsu
Print_ISBN :
978-1-4673-5557-5
DOI :
10.1109/ICMA.2013.6617934