Scheduling parallel dedicated machines under a single non-shared resource
From MaRDI portal
Publication:1869718
DOI10.1016/S0377-2217(02)00246-1zbMATH Open1037.90030MaRDI QIDQ1869718FDOQ1869718
Authors: Hans Kellerer, V. A. Strusevich 
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Scheduling parallel dedicated machines with the speeding-up resource
- Scheduling for parallel dedicated machines with a single server
- Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Scheduling with batching: A review
- Title not available (Why is that?)
- Scheduling subject to resource constraints: Classification and complexity
- Open Shop Scheduling to Minimize Finish Time
- Makespan minimization in open shops: A polynomial time approximation scheme
- Parallel machine scheduling with a common server
- Scheduling for parallel dedicated machines with a single server
- Title not available (Why is that?)
- An open shop scheduling problem with a non-bottleneck machine
Cited In (23)
- Production, maintenance and resource scheduling: a review
- Schedule grouped jobs on parallel machines with single mold constraint
- Parallel dedicated machines scheduling with chain precedence constraints
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- Restricted assignment scheduling with resource constraints
- 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
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Scheduling on two identical machines with a speed-up resource
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- An approximation algorithm for scheduling on three dedicated machines
- Machine scheduling with resource dependent processing times
- Resource leveling in a machine environment
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- Scheduling incompatible tasks on two machines
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- A job-shop problem with one additional resource type
- Scheduling parallel dedicated machines with the speeding-up resource
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
This page was built for publication: Scheduling parallel dedicated machines under a single non-shared resource
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869718)
