Batch scheduling with deadlines on parallel machines

DOI10.1023/A:1018912114491MaRDI QIDQ1273116zbMATH OpenOpenAlexWikidataFDO

Authors Peter Brucker, M. Y. Kovalyov, Y. Shafransky, Frank Werner

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

batchescomputational complexityfully polynomial approximation schemeNP-hardparallel machinessequence-independent machine set-up time

Mathematics Subject Classification ID

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

Recommendations

• Parallel machine batching and scheduling with deadlines
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Scheduling jobs with release dates on parallel batch processing machines
• Lot-sizing scheduling with batch setup times

Cites work

• Batch scheduling with deadlines on parallel machines
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Scheduling Groups of Jobs on a Single Machine
• Scheduling with deadlines and loss functions

Cited in

(20)

• Scheduling jobs with release dates on parallel batch processing machines
• Batch scheduling with deadlines on parallel machines
• Parallel machine batching and scheduling with deadlines
• Heuristic methods for the identical parallel machine flowtime problem with set-up times
• A polynomial algorithm for lot-size scheduling of two type tasks.
• Scheduling with batching: A review
• MIP formulations and heuristics for solving parallel batching problems
• A survey of scheduling problems with setup times or costs
• Approximations and auctions for scheduling batches on related machines
• Research on the parallel-batch scheduling with linearly lookahead model
• Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Simultaneous batching and scheduling using dynamic decomposition on a grid
• An alternative approach for proving the NP-hardness of optimization problems
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Simple paths with exact and forbidden lengths
• Batching-based approaches for optimized packing of jobs in the spatial scheduling problem
• Parallel batch scheduling of equal-length jobs with release and due dates
• Optimally competitive list batching

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

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