Minimizing makespan on a single burn-in oven in semiconductor manufacturing
type: Item
instance of: scholarly article
title: Minimizing makespan on a single burn-in oven in semiconductor manufacturing
zbMATH Open document ID: 0971.90033
DOI: 10.1016/S0377-2217(98)00391-9
published in: European Journal of Operational Research
publication date: 2001-01-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 1506721
zbMATH Keywords: makespan
zbMATH Keywords: scheduling
zbMATH Keywords: single burn-in oven
zbMATH Keywords: semiconductor manufacturing
zbMATH Keywords: batch processing machine
zbMATH Keywords: maximum completion time
zbMATH Keywords: static case
zbMATH Keywords: dynamic case
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: heuristics
author: Chang Sup Sung
author: You In Choung
MaRDI profile type: Publication
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: Minimizing total completion time on a batch processing machine with job families
cites work: Optimal control of batch service queues
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: A General Class of Bulk Queues with Poisson Input
cites work: The use of upstream and downstream information in scheduling semiconductor batch operations
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Scheduling batch processing machines with incompatible job families
cites work: Scheduling Groups of Jobs on a Single Machine
full work available at URL: s0377-2217(98)00391-9
OpenAlex ID: W1994027672
description: scientific article; zbMATH DE number 1506721