Parallel machine batching and scheduling with deadlines
From MaRDI portal
Publication:1567300
DOI<109::AID-JOS38>3.0.CO;2-0 10.1002/(SICI)1099-1425(200003/04)3:2<109::AID-JOS38>3.0.CO;2-0zbMath0973.90032OpenAlexW2015365235MaRDI QIDQ1567300
Mikhail Y. Kovalyov, Cheng, T. C. Edwin
Publication date: 5 December 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200003/04)3:2<109::aid-jos38>3.0.co;2-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Graphical Techniques for Detecting Lines with the Hough Transform, A survey of scheduling problems with setup times or costs, A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
Cites Work
- Batch sizing and job sequencing on a single machine
- One-pass batching algorithms for the one-machine problem
- Fast approximation algorithm for job sequencing with deadlines
- A polynomial algorithm for a one machine batching problem
- Batch scheduling with deadlines on parallel machines
- Single machine scheduling with batch deliveries
- The complexity of one-machine batching problems
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- A fully polynomial approximation scheme for the total tardiness problem
- Batch scheduling to minimize total completion time
- Scheduling with batching: A review
- Batching to Minimize Flow Times on One Machine
- Scheduling identical jobs on uniform parallel machines
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Algorithms for Scheduling Independent Tasks
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the Complexity of Scheduling with Batch Setup Times
- Approximation scheduling algorithms: a survey
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- Batch Delivery Scheduling on a Single Machine
- Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
- Scheduling Groups of Jobs on a Single Machine
- Unnamed Item
