The following pages link to (Q4849545):
Displayed 16 items.
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results (Q814422) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170) (← links)
- A case study of mutual routing-scheduling reformulation (Q880564) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality (Q1347601) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Constraint-directed techniques for scheduling alternative activities (Q1583239) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- A theoretic and practical framework for scheduling in a stochastic environment (Q2268505) (← links)
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem (Q5387635) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)