Constraint propagation techniques for the disjunctive scheduling problem
From MaRDI portal
Publication:1583518
DOI10.1016/S0004-3702(00)00040-0zbMATH Open0948.68010OpenAlexW2017549627MaRDI QIDQ1583518FDOQ1583518
Authors: Ulrich Dorndorf, Erwin Pesch, Toàn Phan-Huy 
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
Recommendations
- Scheduling and constraint propagation
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- Constraint Propagation Based Scheduling of Job Shops
- Constraint satisfaction techniques in planning and scheduling: an introduction
- Schedulers and redundancy for a class of constraint propagation rules
- scientific article; zbMATH DE number 1882989
- Constraint programming approach to a bilevel scheduling problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
consistencyjob shop schedulingconstraint propagationdisjunctive schedulingbound-consistencyconsistency testsdomain-consistency
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consistency in networks of relations
- Title not available (Why is that?)
- Network-based heuristics for constraint-satisfaction problems
- Constraints, consistency and closure
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Title not available (Why is that?)
- Networks of constraints: Fundamental properties and applications to picture processing
- The one-machine sequencing problem
- A branch and bound algorithm for the job-shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- The job shop scheduling problem: Conventional and new solution techniques
- An optimal k-consistency algorithm
- Constraint propagation techniques for the disjunctive scheduling problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- An existence theorem for packing problems with implications for the computation of optimal machine schedules
- Reasoning about qualitative temporal information
- Adjustment of heads and tails for the job-shop problem
- The Consistent Labeling Problem: Part I
- Arc consistency revisited
- Constraint propagation with interval labels
- A generic arc-consistency algorithm and its specializations
- The logic of constraint satisfaction
- Constraint satisfaction using constraint logic programming
- Constraint satisfaction from a deductive viewpoint
- Synthesizing constraint expressions
- The Consistent Labeling Problem: Part II
- Title not available (Why is that?)
- Using constraint metaknowledge to reduce arc consistency computation
- The job-shop problem and immediate selection
- Title not available (Why is that?)
- Comments on Mohr and Henderson's path consistency algorithm
- Constraint-based job shop scheduling with Ilog Scheduler
- Constraint Propagation Based Scheduling of Job Shops
- Constraint propagation in flexible manufacturing
- Title not available (Why is that?)
Cited In (28)
- Constraint propagation techniques for the disjunctive scheduling problem
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- Improving branch and bound for jobshop scheduling with constraint propagation
- Double girder bridge crane with double cycling: scheduling strategy and performance evaluation
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs
- Constraint propagation in flexible manufacturing
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
- Strong polynomiality of resource constraint propagation
- On not-first/not-last conditions in disjunctive scheduling
- A mixed closure-CSP method for solving scheduling problems
- Principles and Practice of Constraint Programming – CP 2004
- Arc-B-consistency of the inter-distance constraint
- Constraint-Level Advice for Shaving
- AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- Title not available (Why is that?)
- Discussion on: ``Solving transient scheduling problems with constraint programming
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Disruption management in flight gate scheduling
- Depth-first heuristic search for the job shop scheduling problem
- Solving the open shop scheduling problem
- A constraint programming approach for the resource-constrained project scheduling problem
- A metaheuristic solution approach for the time-constrained project scheduling problem
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- GRASP and path relinking for project scheduling under partially renewable resources
- An advanced tabu search algorithm for the job shop problem
Uses Software
This page was built for publication: Constraint propagation techniques for the disjunctive scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583518)
