Stochastic scheduling of a batch processing machine with incompatible job families

DOI10.1023/A:1018922104670MaRDI QIDQ1374434zbMATH OpenOpenAlexFDO

Authors Izak Duenyas, John J. Neale

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)

Recommendations

• Scheduling batch processing machines with incompatible job families
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
• Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
• Multiobjective scheduling of jobs with incompatible families on parallel batch machines
• A stochastic batching and scheduling problem
• Scheduling an unbounded batching machine with job processing time compatibilities

Cited in

(12)

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

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

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