Dynamic scheduling of batch-processing machines with non-identical product sizes

DOI10.1080/00207540600690537zbMath1128.90506OpenAlexW2106907816MaRDI QIDQ5438667

No author found.

Publication date: 24 January 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600690537

zbMATH Keywords

schedulingsimulationbatch-processing machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (4)

Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times ⋮ Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• Knapsack

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Stochastic scheduling of a batch processing machine with incompatible job families
• Scheduling with batching: A review
• Minimizing total completion time on a batch processing machine with job families
• Worst-case analysis of greedy algorithms for the subset-sum problem
• The Batch Loading and Scheduling Problem
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Managing batch processors to reduce lead time in a semiconductor packaging line
• Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
• Scheduling a single batch processing machine with non-identical job sizes
• The use of upstream and downstream information in scheduling semiconductor batch operations
• Scheduling batch processing machines with incompatible job families
• Scheduling a batch processing machine with non-identical job sizes
• Dynamic scheduling of batch servers with compatible product families
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Adaptive scheduling of batch servers in flow shops
• Scheduling Groups of Jobs on a Single Machine
• A General Class of Bulk Queues with Poisson Input
• Optimal control of batch service queues

This page was built for publication: Dynamic scheduling of batch-processing machines with non-identical product sizes