Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
type: Item
instance of: scholarly article
title: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
zbMATH Open document ID: 0995.90036
DOI: 10.1016/S0305-0548(00)00098-8
author: V. Pereyra
published in: Computers \& Operations Research
publication date: 2002-10-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1740078
zbMATH Keywords: batch scheduling
zbMATH Keywords: makespan
zbMATH Keywords: job family
zbMATH Keywords: dynamic arrival
MaRDI profile type: Publication
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Minimizing total completion time on a batch processing machine with job families
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Scheduling with agreeable release times and due dates on a batch processing machine
cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
cites work: Minimizing makespan on a single burn-in oven in semiconductor manufacturing
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: Scheduling batch processing machines with incompatible job families
cites work: A General Class of Bulk Queues with Poisson Input
cites work: Optimal control of batch service queues
cites work: The use of upstream and downstream information in scheduling semiconductor batch operations
cites work: Stochastic scheduling of a batch processing machine with incompatible job families
cites work: A neural network approach for batching decisions in wafer fabrication
cites work: Scheduling Groups of Jobs on a Single Machine
full work available at URL: s0305-0548(00)00098-8
OpenAlex ID: W1974873411
description: scientific article; zbMATH DE number 1740078