Scheduling parallel dedicated machines under a single non-shared resource
From MaRDI portal
(Redirected from Publication:1869718)
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
Cites work
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 736667 (Why is no real title available?)
- An open shop scheduling problem with a non-bottleneck machine
- Makespan minimization in open shops: A polynomial time approximation scheme
- Open Shop Scheduling to Minimize Finish Time
- Parallel machine scheduling with a common server
- Scheduling for parallel dedicated machines with a single server
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling with batching: A review
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
- Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Machine scheduling with resource dependent processing times
- An approximation algorithm for scheduling on three dedicated machines
- 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
- Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
- Scheduling parallel dedicated machines with the speeding-up resource
- 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)
