Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
DOI10.1023/A:1009613717770zbMATH Open1064.90544MaRDI QIDQ1854902FDOQ1854902
Authors: Philippe Baptiste, Claude Le Pape 
Publication date: 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Recommendations
- Resource constraints for preemptive job-shop scheduling
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- Study on constraint scheduling algorithm for job shop problems with multiple constraint machines
- Constraint-based job shop scheduling with Ilog Scheduler
- An optimal method for the preemptive job shop scheduling problem
constraint programmingresource constraintsconstraint propagationtimetablespreemptive schedulingjob-shop schedulinglimited discrepancy searchedge-findingdepth-bounded discrepancy search
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (8)
- New filtering for the cumulative constraint in the context of non-overlapping rectangles
- Failure-directed search for constraint-based scheduling
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Production scheduling with complex precedence constraints in parallel machines
- Title not available (Why is that?)
- Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
Uses Software
This page was built for publication: Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854902)
