Scheduling problems for parallel dedicated machines under multiple resource constraints.
From MaRDI portal
Publication:1417559
DOI10.1016/S0166-218X(03)00433-5zbMath1053.90039MaRDI QIDQ1417559
Hans Kellerer, Vitaly A. Strusevich
Publication date: 5 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (22)
Scheduling with flexible resources in parallel workcenters to minimize maximum completion time ⋮ Approximation of the parallel machine scheduling problem with additional unit resources ⋮ Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints ⋮ Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ Algorithms for the unrelated parallel machine scheduling problem with a resource constraint ⋮ Machine scheduling with resource dependent processing times ⋮ Parallel dedicated machines scheduling with chain precedence constraints ⋮ Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints ⋮ Resource leveling in a machine environment ⋮ Scheduling on two identical machines with a speed-up resource ⋮ A job-shop problem with one additional resource type ⋮ Restricted assignment scheduling with resource constraints ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ Scheduling parallel dedicated machines with the speeding‐up resource ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ Parallel machine scheduling with tool loading ⋮ Scheduling jobs with time-resource tradeoff via nonlinear programming ⋮ Scheduling incompatible tasks on two machines ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling subject to resource constraints: Classification and complexity
- Makespan minimization in open shops: A polynomial time approximation scheme
- Scheduling parallel dedicated machines under a single non-shared resource
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Open Shop Scheduling to Minimize Finish Time
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- Two-Machine Open Shops with Renewable Resources
- Short Shop Schedules
- Scheduling for parallel dedicated machines with a single server
This page was built for publication: Scheduling problems for parallel dedicated machines under multiple resource constraints.
