A new dynamic look-ahead scheduling procedure for batching machines
From MaRDI portal
Publication:1600008
DOI10.1002/jos.99zbMath1014.90036OpenAlexW1985112068MaRDI QIDQ1600008
T. Zambelli, R. Cigolini, A. Portioli, Marco Perona
Publication date: 9 September 2002
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.99
Related Items (6)
Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead ⋮ Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling a batching machine
- Single machine scheduling with batch deliveries
- Scheduling with agreeable release times and due dates on a batch processing machine
- Batching to Minimize Flow Times on One Machine
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Heuristic scheduling of jobs on a multi-product batch processing machine
- Managing batch processors to reduce lead time in a semiconductor packaging line
- Evaluating scheduling heuristics for non-identical parallel processors
- Batching and Scheduling in FMS Hubs: Flow Time Considerations
- Scheduling a single batch processing machine with non-identical job sizes
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
This page was built for publication: A new dynamic look-ahead scheduling procedure for batching machines
