Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling

Authors:
Dario Pacino;Pascal Van Hentenryck
Affiliations:
IT-University of Copenhagen;Brown University
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Year:
2011

Citing 7
Cited 3

Job-shop scheduling with multi-purpose machines

Computing
Routing and scheduling in a flexible job shop by tabu search

Annals of Operations Research - Special issue on Tabu search
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem

Computers and Operations Research
Texture-based heuristics for scheduling revisited

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming

Randomized adaptive vehicle decomposition for large-scale power restoration

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Flexible job shop scheduling using hybrid differential evolution algorithms

Computers and Industrial Engineering
An integrated search heuristic for large-scale flexible job shop scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a constraint-based scheduling approach to the flexible jobshop, a generalization of the traditional jobshop scheduling where activities have a choice of machines. It studies both large neighborhood (LNS) and adaptive randomized decomposition (ARD) schemes, using random, temporal, and machine decompositions. Empirical results on standard benchmarks show that, within 5 minutes, both LNS and ARD produce many new best solutions and are about 0.5% in average from the best-known solutions. Moreover, over longer runtimes, they improve 60% of the best-known solutions and match the remaining ones. The empirical results also show the importance of hybrid decompositions in LNS and ARD.