Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
From MaRDI portal
(Redirected from Publication:3466772)
Recommendations
- scientific article; zbMATH DE number 194622
- Solution-guided multi-point constructive search for job shop scheduling
- Applying constraint satisfaction techniques to job shop scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- A search space analysis of the job shop scheduling problem
- Discrepancy search for the flexible job shop scheduling problem
- Constraint Propagation Based Scheduling of Job Shops
Cites work
- A branch \(\&\) bound algorithm for the open-shop problem
- A branch \& bound method for the general-shop problem with sequence dependent setup-times
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- A Computational Study of the Job-Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A hybrid approach to scheduling with earliness and tardiness costs
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- A memetic algorithm for the job-shop with time-lags
- A new lower bound for the open-shop problem
- A new particle swarm optimization for the open shop scheduling problem
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- An advanced tabu search algorithm for the job shop problem
- An Algorithm for Solving the Job-Shop Problem
- An optimal constraint programming approach to the open-shop problem
- Benchmarks for basic scheduling problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- scientific article; zbMATH DE number 802345 (Why is no real title available?)
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
- Job-shop scheduling with blocking and no-wait constraints
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- On not-first/not-last conditions in disjunctive scheduling
- Optimal job insertion in the no-wait job shop
- Optimal speedup of Las Vegas algorithms
- Optimal two- and three-stage production schedules with set-up time included
- Ordonnancements à contraintes disjonctives
- Principles and Practice of Constraint Programming – CP 2004
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- Solution-guided multi-point constructive search for job shop scheduling
- Temporal constraint networks
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(11)- 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
- Solution-guided multi-point constructive search for job shop scheduling
- A decomposition-based implementation of search strategies
- Failure-directed search for constraint-based scheduling
- A binary search algorithm for the general coupled task scheduling problem
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Genetic algorithm modification for production scheduling
This page was built for publication: Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466772)
