An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems
From MaRDI portal
Publication:6659821
DOI10.1111/itor.13504MaRDI QIDQ6659821
Gonzalo Mejía, Armin Lüer-Villagra, Francisco Yuraszeck
Publication date: 9 January 2025
Published in: International Transactions in Operational Research (Search for Journal in Brave)
parallel machinesopen shopjob shopconstraint programmingresource-constrained project schedulingmixed shopgroup shopstage shop
Cites Work
- Unnamed Item
- Explaining the \texttt{cumulative} propagator
- An ant colony optimization algorithm for shop scheduling problems
- Scheduling subject to resource constraints: Classification and complexity
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Benchmarks for shop scheduling problems
- Group-shop scheduling with sequence-dependent set-up and transportation times
- An effective heuristic algorithm for the partial shop scheduling problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Two machine mixed shop scheduling problem with controllable machine speeds
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
- Benchmarks for basic scheduling problems
- A fast tabu search algorithm for the group shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Open Shop Scheduling to Minimize Finish Time
- The Complexity of Flowshop and Jobshop Scheduling
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
- Scheduling
- A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
- Multi-project scheduling: a benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates
- New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms
This page was built for publication: An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems