Bounds for parallel machine scheduling with predefined parts of jobs and setup time
From MaRDI portal
Publication:1708539
DOI10.1007/s10479-017-2615-zzbMath1384.90045OpenAlexW2753109818MaRDI QIDQ1708539
Publication date: 23 March 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2615-z
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Single workgroup scheduling problem with variable processing personnel ⋮ Competing through the last mile: strategic 3D printing in a city logistics context ⋮ Scheduling problem in seru production system considering DeJong's learning effect and job splitting ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- On-line scheduling with setup costs
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Scheduling job families on non-identical parallel machines with time constraints
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
- Parallel machine scheduling with splitting jobs
- List scheduling in a parallel machine environment with precedence constraints and setup times
- A survey of scheduling problems with setup times or costs
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Bounds for List Schedules on Uniform Processors
- Bounds for LPT Schedules on Uniform Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling
This page was built for publication: Bounds for parallel machine scheduling with predefined parts of jobs and setup time
