Controlling job arrivals with processing time windows into batch processor buffer

DOI10.1007/s10479-011-0952-xzbMath1233.90144OpenAlexW2052511568MaRDI QIDQ763114

Stanley B. Gershwin, Appa Iyer Sivakumar, John Benedict C. Tajan

Publication date: 9 March 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0952-x

zbMATH Keywords

perishable itemsbatch processorprocessing time windowwafer fabrication

Mathematics Subject Classification ID

Production models (90B30)

Related Items (1)

A general model for batch building processes under the timeout and capacity rules

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling with agreeable release times and due dates on a batch processing machine
• Minimizing due date related performance measures on two batch processing machines
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

This page was built for publication: Controlling job arrivals with processing time windows into batch processor buffer