Scheduling parallel dedicated machines under a single non-shared resource
From MaRDI portal
Publication:1869718
DOI10.1016/S0377-2217(02)00246-1zbMath1037.90030MaRDI QIDQ1869718
Hans Kellerer, Vitaly A. Strusevich
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items
Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints ⋮ 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 ⋮ An improved algorithm for parallel machine scheduling under additional resource constraints ⋮ A job-shop problem with one additional resource type ⋮ Scheduling problems for parallel dedicated machines under multiple resource constraints. ⋮ 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 ⋮ FPTAS for the two identical parallel machine problem with a single operator under the free changing mode ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ 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
- Scheduling subject to resource constraints: Classification and complexity
- Makespan minimization in open shops: A polynomial time approximation scheme
- An open shop scheduling problem with a non-bottleneck machine
- Parallel machine scheduling with a common server
- Scheduling with batching: A review
- Open Shop Scheduling to Minimize Finish Time
- Scheduling for parallel dedicated machines with a single server
- Unnamed Item
- Unnamed Item
- Unnamed Item
