Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
From MaRDI portal
Publication:3466772
DOI10.1287/ijoc.2014.0625zbMath1329.90061MaRDI QIDQ3466772
Emmanuel Hebrard, Diarmuid Grimes
Publication date: 25 January 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2014.0625
scheduling; combinatorial optimization; constraint programming; adaptive search heuristics; disjunctive/unary resource
Related Items
A binary search algorithm for the general coupled task scheduling problem, Genetic algorithm modification for production scheduling, The job shop scheduling problem with convex costs, Short-term scheduling of production fleets in underground mines using CP-based LNS, A neighborhood for complex job shop scheduling problems with regular objectives, Underground mine scheduling of mobile machines using constraint programming and large neighborhood search, Optimization of the integrated problem of employee timetabling and job shop scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Optimal speedup of Las Vegas algorithms
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Temporal constraint networks
- Adjustment of heads and tails for the job-shop problem
- A branch \(\&\) bound algorithm for the open-shop problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- On not-first/not-last conditions in disjunctive scheduling
- Job-shop scheduling with blocking and no-wait constraints
- A hybrid approach to scheduling with earliness and tardiness costs
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- A new lower bound for the open-shop problem
- Benchmarks for basic scheduling problems
- Optimal job insertion in the no-wait job shop
- An advanced tabu search algorithm for the job shop problem
- A memetic algorithm for the job-shop with time-lags
- A new particle swarm optimization for the open shop scheduling problem
- An Optimal Constraint Programming Approach to the Open-Shop Problem
- Optimal two- and three-stage production schedules with setup times included
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Ordonnancements à contraintes disjonctives
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- Principles and Practice of Constraint Programming – CP 2004
