Scheduling with batching: Two job types

DOI10.1016/S0166-218X(96)00039-XzbMath0873.90050OpenAlexW2079418077MaRDI QIDQ5961608

Dan Landy, Dorit S. Hochbaum

Publication date: 21 April 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

processing time2-weight batchingjob completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey of scheduling problems with setup times or costs, Optimal batching in a wafer fabrication facility using a multiproduct G/G/c model with batch processing

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Geometric applications of a matrix-searching algorithm
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• The complexity of one-machine batching problems
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Batching to Minimize Flow Times on One Machine
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine