Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
From MaRDI portal
(Redirected from Publication:1854902)
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
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
- scientific article; zbMATH DE number 2080044 (Why is no real title available?)
- 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
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)
