Dynamic scheduling of batch servers with compatible product families
From MaRDI portal
Publication:4666778
DOI10.1080/00207540412331270450zbMath1114.90394OpenAlexW2101070855MaRDI QIDQ4666778
No author found.
Publication date: 5 April 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540412331270450
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times ⋮ Virtual manufacturing cells: A taxonomy of past research and identification of future research issues ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
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
- The Batch Loading and Scheduling Problem
- Batching and Scheduling Jobs on Batch and Discrete Processors
- 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
- Control of a batch-processing machine: A computational 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
- 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 servers with compatible product families
