scientific article; zbMATH DE number 802345
From MaRDI portal
Publication:4849545
Recommendations
- Scheduling and constraint propagation
- Constraint satisfaction problems: Algorithms and applications
- A constraint programming approach for the resource-constrained project scheduling problem
- Applying constraint satisfaction techniques to job shop scheduling
- Interactive scheduling as a constraint satisfiability problem
Cited in
(41)- A logic approach to the resolution of constraints in timetabling
- Temporal constraint satisfaction techniques in job shop scheduling problem solving
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
- Interactive scheduling as a constraint satisfiability problem
- Backtracking algorithms for disjunctions of temporal constraints
- Constraint-directed techniques for scheduling alternative activities
- Constraint propagation techniques for the disjunctive scheduling problem
- On not-first/not-last conditions in disjunctive scheduling
- Constraint programming and operations research
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- Redundant cumulative constraints to compute preemptive bounds
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Metaheuristics: A bibliography
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- A theoretic and practical framework for scheduling in a stochastic environment
- A quadratic edge-finding filtering algorithm for cumulative resource constraints
- A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
- Discussion on: ``Solving transient scheduling problems with constraint programming
- scientific article; zbMATH DE number 1708123 (Why is no real title available?)
- On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
- scientific article; zbMATH DE number 1822445 (Why is no real title available?)
- scientific article; zbMATH DE number 4174362 (Why is no real title available?)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Interval-Based Timing Constraints Their Satisfactions and Applications
- Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
- Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Streamlining variational inference for constraint satisfaction problems
- Solving the open shop scheduling problem
- Constraint propagation on GPU: a case study for the cumulative constraint
- Explaining the \texttt{cumulative} propagator
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Improved timetable edge finder rule for cumulative constraint with profile
- Constraint propagation on GPU: a case study for the cumulative constraint
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Principles for the design of large neighborhood search
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- A case study of mutual routing-scheduling reformulation
- Fast combination of scheduling chains under resource and time constraints
- A branch and bound method for the job-shop problem with sequence-dependent setup times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4849545)
