Batching to Minimize Flow Times on Parallel Heterogeneous Machines

DOI10.1287/mnsc.35.5.607zbMath0674.90050OpenAlexW1967461192MaRDI QIDQ3829340

Uday S. Karmarkar, Gregory Dobson, Jeffrey L. Rummel

Publication date: 1989

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.35.5.607

zbMATH Keywords

parallel machinesbatchingallocation rulesapproximate closed-form solutionheuristic loading-rulemean flow timesmultiple-machine work- centerssingle product case

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment ⋮ Approximation algorithms for the single-machine scheduling with a period of maintenance ⋮ Unnamed Item ⋮ Batch scheduling to minimize total completion time ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ Single machine lot scheduling with non-uniform lot capacities and processing times ⋮ A note on a single-machine lot scheduling problem with indivisible orders ⋮ Lot scheduling on a single machine ⋮ Multi-item batching heuristics for minimization of queueing delays ⋮ Production planning with load dependent lead times: An update of research ⋮ A general approximation for the single product lot sizing model with queueing delays ⋮ Product grouping for batch processes