NDLI: Iterative local search with leap-frog steps for job shop scheduling problems

Content Provider	IEEE Xplore Digital Library
Author	Yong Ming Wang Hong Li Yin
Copyright Year	2013
Description	Author affiliation: Fac. of Manage. & Econ., Kunming Univ. of Sci. & Technol., Kunming, China (Yong Ming Wang) \|\| Sch. of Comput. Sci. & Inf. Technol., Yunnan Normal Univ., Kunming, China (Hong Li Yin)
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.
Starting Page	297
Ending Page	301
File Size	990215
Page Count	5
File Format	PDF
ISBN	9781467355575
e-ISBN	9781467355605
DOI	10.1109/ICMA.2013.6617934
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-08-04
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Simulated annealing Schedules Job shop scheduling Optimal scheduling Iterative methods Search problems Processor scheduling Simulated annealing algorithm Iterative local search methods Leap-frog steps
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An improved PSO search method for the job shop scheduling problem

Coupling local search methods and simulated annealing to the job shop scheduling problem with transportation

Genetic Algorithm Nested with Simulated Annealing for Big Job Shop Scheduling Problems

A simulated annealing algorithm based on bottleneck jobs for the open shop scheduling problem

Branch and bound algorithm in optimizing job shop scheduling problems

Scheduling multiple job problems with guided evolutionary simulated annealing approach

A hybrid Pareto-based local search for multi-objective flexible job shop scheduling problem

Hybridization of simulated annealing with quenching for job shop scheduling

Descending Deviation Optimization techniques for scheduling problems

Iterative local search with leap-frog steps for job shop scheduling problems

Similar Documents

An improved PSO search method for the job shop scheduling problem

Coupling local search methods and simulated annealing to the job shop scheduling problem with transportation

Genetic Algorithm Nested with Simulated Annealing for Big Job Shop Scheduling Problems

A simulated annealing algorithm based on bottleneck jobs for the open shop scheduling problem

Branch and bound algorithm in optimizing job shop scheduling problems

Scheduling multiple job problems with guided evolutionary simulated annealing approach

A hybrid Pareto-based local search for multi-objective flexible job shop scheduling problem

Hybridization of simulated annealing with quenching for job shop scheduling

Descending Deviation Optimization techniques for scheduling problems

Iterative local search with leap-frog steps for job shop scheduling problems