A new dynamic look-ahead scheduling procedure for batching machines
type: Item
instance of: scholarly article
title: A new dynamic look-ahead scheduling procedure for batching machines
zbMATH Open document ID: 1014.90036
author: R. Cigolini
author: A. Portioli
author: T. Zambelli
author: Marco Perona
published in: Journal of Scheduling
publication date: 2002-09-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1751679
zbMATH Keywords: dispatching
zbMATH Keywords: batching
zbMATH Keywords: wafer fab
MaRDI profile type: Publication
full work available at URL: jos.99
OpenAlex ID: W1985112068
cites work: Heuristic scheduling of jobs on a multi-product batch processing machine
cites work: Batching and Scheduling in FMS Hubs: Flow Time Considerations
cites work: Batching to Minimize Flow Times on One Machine
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
cites work: Single machine scheduling with batch deliveries
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Scheduling with agreeable release times and due dates on a batch processing machine
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Managing batch processors to reduce lead time in a semiconductor packaging line
cites work: Scheduling a batching machine
cites work: Evaluating scheduling heuristics for non-identical parallel processors
DOI: 10.1002/JOS.99
description: scientific article; zbMATH DE number 1751679