Stochastic scheduling of a batch processing machine with incompatible job families

DOI10.1023/A:1018922104670zbMath0890.90099OpenAlexW21387639MaRDI QIDQ1374434

John J. Neale, Izak Duenyas

Publication date: 4 December 1997

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

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

zbMATH Keywords

random processing timesheuristic schedulingsingle batch processing machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance ⋮ Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals ⋮ Markov-modulated analysis of a spare parts system with random lead times and disruption risks ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ Adaptive scheduling of batch servers in flow shops ⋮ A survey of scheduling with parallel batch (p-batch) processing

This page was built for publication: Stochastic scheduling of a batch processing machine with incompatible job families