Batch scheduling with deadlines on parallel machines

DOI10.1023/A:1018912114491zbMath0913.90160OpenAlexW1511517624MaRDI QIDQ1273116

Mikhail Y. Kovalyov, Frank Werner, Yakov M. Shafransky, Peter Brucker

Publication date: 7 March 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018912114491

zbMATH Keywords

computational complexityparallel machinesNP-hardbatchesfully polynomial approximation schemesequence-independent machine set-up time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Batch scheduling with deadlines on parallel machines: an NP-hard case ⋮ Optimally competitive list batching ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ Approximations and auctions for scheduling batches on related machines ⋮ Simple paths with exact and forbidden lengths ⋮ MIP formulations and heuristics for solving parallel batching problems ⋮ Scheduling with batching: A review ⋮ Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem ⋮ A survey of scheduling problems with setup times or costs ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ Batch scheduling with deadlines on parallel machines ⋮ Parallel machine batching and scheduling with deadlines ⋮ A polynomial algorithm for lot-size scheduling of two type tasks.

Cites Work

• Batch scheduling with deadlines on parallel machines
• Scheduling with Deadlines and Loss Functions
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Scheduling Groups of Jobs on a Single Machine
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Batch scheduling with deadlines on parallel machines