NDLI: Intensified iterative deepening A* with application to job shop scheduling

Content Provider	Springer Nature Link
Author	Mencía, Carlos Sierra, María R. Varela, Ramiro
Copyright Year	2012
Abstract	We propose a novel, exact any-time search strategy that combines iterative deepening $$\text{ A}$$ * ( $$\text{ IDA}$$ ) with depth-first search and we consider the job shop scheduling problem with makespan minimization as a test bed. The combination of these search strategies is done so that limited depth-first searches are issued from some of the states distributed along the frontier reached by $$\text{ IDA}$$ in each iteration. In this way, a proper equilibrium between intensification and diversification search effort is achieved while the algorithm keeps the capability of obtaining tight lower bounds. To evaluate the proposed strategy and to compare it with other methods, we have conducted an experimental study involving a number of conventional benchmarks with instances of various sizes. The results of these experiments show that the proposed algorithm takes less time than other methods in reaching optimal solutions for small and medium-size instances, and that it is quite competitive in reaching good solutions and good lower bounds for the instances that cannot be optimally solved.
Starting Page	1245
Ending Page	1255
Page Count	11
File Format	PDF
ISSN	09565515
Journal	Journal of Intelligent Manufacturing
Volume Number	25
Issue Number	6
e-ISSN	15728145
Language	English
Publisher	Springer US
Publisher Date	2013-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Job shop scheduling Heuristic search Depth-first search Iterative deepening A* Hybrid algorithms Production/Logistics/Supply Chain Manufacturing, Machines, Tools Control, Robotics, Mechatronics
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Artificial Intelligence Software

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

A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study

A comparison of multiobjective depth-first algorithms

Note to “Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm”

New schedule generation schemes for the job-shop problem with operators

A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines

Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling

A research survey: review of AI solution strategies of job shop scheduling problem

An AIS-based hybrid algorithm for static job shop scheduling problem

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

Intensified iterative deepening A* with application to job shop scheduling

Similar Documents

A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study

A comparison of multiobjective depth-first algorithms

Note to “Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm”

New schedule generation schemes for the job-shop problem with operators

A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines

Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling

A research survey: review of AI solution strategies of job shop scheduling problem

An AIS-based hybrid algorithm for static job shop scheduling problem

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

Intensified iterative deepening A* with application to job shop scheduling