Parallel machine batching and scheduling with deadlines

DOI10.1002/(SICI)1099-1425(200003/04)3:2%3C109::AID-JOS38%3E3.0.CO;2-0MaRDI QIDQ1567300zbMATH OpenOpenAlexFDO

Authors M. Y. Kovalyov, T. C. Edwin Cheng

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%3C109::aid-jos38%3E3.0.co;2-0

zbMATH Keywords

parallel machine schedulingbatching approximation scheme

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Batch scheduling with deadlines on parallel machines
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Parallel Machine Scheduling with Batch Setup Times
• Scheduling parallel batching machines in a sequence
• Preemptive scheduling with deadlines on parallel machines
• Parallel machine scheduling with high multiplicity
• Optimal batch schedules for parallel machines
• Scheduling parallel batch processing machines with non-identical job sizes
• Parallel machine scheduling with job delivery coordination
• Parallel-machine scheduling with time dependent processing times

Cites work

• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A fully polynomial approximation scheme for the total tardiness problem
• A polynomial algorithm for a one machine batching problem
• Algorithms for Scheduling Independent Tasks
• Approximation scheduling algorithms: a survey
• Batch Delivery Scheduling on a Single Machine
• Batch scheduling to minimize total completion time
• Batch scheduling with deadlines on parallel machines
• Batch sizing and job sequencing on a single machine
• Batching to Minimize Flow Times on One Machine
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Fast approximation algorithm for job sequencing with deadlines
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• On the Complexity of Scheduling with Batch Setup Times
• One-pass batching algorithms for the one-machine problem
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Scheduling identical jobs on uniform parallel machines
• Scheduling with batching: A review
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• Single machine scheduling with batch deliveries
• The complexity of one-machine batching problems

Cited in

(7)

• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• A survey of scheduling problems with setup times or costs
• Graphical Techniques for Detecting Lines with the Hough Transform
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines

This page was built for publication: Parallel machine batching and scheduling with deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567300)