Arc-B-consistency of the inter-distance constraint
From MaRDI portal
(Redirected from Publication:879973)
Recommendations
- Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs
- The \textsc{AllDifferent} constraint with precedences
- An optimal arc consistency algorithm for a particular case of sequence constraint
- Approximated consistency for the automatic recording constraint
- Constraint propagation techniques for the disjunctive scheduling problem
Cites work
- A Computational Study of the Job-Shop Scheduling Problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Accelerating filtering techniques for numeric CSPs
- Adjustment of heads and tails for the job-shop problem
- Computational Complexity of Discrete Optimization Problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- On not-first/not-last conditions in disjunctive scheduling
- Properties of optimal schedules in preemptive shop scheduling
- Runway sequencing with holding patterns
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Solving the open shop scheduling problem
Cited in
(3)
This page was built for publication: Arc-B-consistency of the inter-distance constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879973)