Constraint propagation techniques for the disjunctive scheduling problem
From MaRDI portal
Publication:1583518
DOI10.1016/S0004-3702(00)00040-0zbMath0948.68010OpenAlexW2017549627MaRDI QIDQ1583518
Ulrich Dorndorf, Toàn Phan-Huy, Erwin Pesch
Publication date: 26 October 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00040-0
consistencyjob shop schedulingconstraint propagationdisjunctive schedulingbound-consistencyconsistency testsdomain-consistency
Related Items (15)
A metaheuristic solution approach for the time-constrained project scheduling problem ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints ⋮ A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ A constraint programming approach for the resource-constrained project scheduling problem ⋮ An advanced tabu search algorithm for the job shop problem ⋮ GRASP and path relinking for project scheduling under partially renewable resources ⋮ Disruption management in flight gate scheduling ⋮ Solving the open shop scheduling problem ⋮ An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Constraint propagation techniques for the disjunctive scheduling problem ⋮ Double girder bridge crane with double cycling: scheduling strategy and performance evaluation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comments on Mohr and Henderson's path consistency algorithm
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Constraint propagation with interval labels
- Network-based heuristics for constraint-satisfaction problems
- Constraint satisfaction from a deductive viewpoint
- An optimal k-consistency algorithm
- The one-machine sequencing problem
- A generic arc-consistency algorithm and its specializations
- The logic of constraint satisfaction
- Constraint satisfaction using constraint logic programming
- Reasoning about qualitative temporal information
- Consistency in networks of relations
- The job shop scheduling problem: Conventional and new solution techniques
- Constraints, consistency and closure
- Using constraint metaknowledge to reduce arc consistency computation
- A branch and bound algorithm for the job-shop scheduling problem
- The job-shop problem and immediate selection
- Adjustment of heads and tails for the job-shop problem
- Constraint-based job shop scheduling with Ilog Scheduler
- Constraint propagation in flexible manufacturing
- Constraint propagation techniques for the disjunctive scheduling problem
- Networks of constraints: Fundamental properties and applications to picture processing
- An Algorithm for Solving the Job-Shop Problem
- The Consistent Labeling Problem: Part I
- The Consistent Labeling Problem: Part II
- A Computational Study of the Job-Shop Scheduling Problem
- Synthesizing constraint expressions
- An existence theorem for packing problems with implications for the computation of optimal machine schedules
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Constraint Propagation Based Scheduling of Job Shops
- Arc consistency revisited
This page was built for publication: Constraint propagation techniques for the disjunctive scheduling problem
