A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
type: Item
instance of: scholarly article
title: A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
zbMATH Open document ID: 1251.90184
author: Lixin Wang
author: Ming Cheng
author: Subhash C. Sarin
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6107571
zbMATH Keywords: single machine
zbMATH Keywords: wafer fabrication
zbMATH Keywords: multiple-lots-per-carrier
zbMATH Keywords: single-wafer-processing
zbMATH Keywords: branch-and-bound
zbMATH Keywords: completion time
zbMATH Keywords: \texttt{CPLEX 12.2}
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2011.08.012
OpenAlex ID: W2033097765
cites work: Scheduling multiple orders per job in a single machine to minimize total completion time
cites work: Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
cites work: Column generation heuristics for multiple machine, multiple orders per job scheduling problems
cites work: Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
cites work: Scheduling with batching: A review
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Scheduling a single batch processing machine with non-identical job sizes
cites work: Scheduling a batch processing machine with non-identical job sizes
cites work: The Batch Loading and Scheduling Problem
cites work: Principles of Sequencing and Scheduling
cites work: Batch sizing and job sequencing on a single machine
cites work: Multiple orders per job batch scheduling with incompatible jobs
DOI: 10.1016/J.COR.2011.08.012
Recommended article: Single machine lot scheduling to minimize the total weighted (discounted) completion time
Recommended article: A note on lot scheduling on a single machine to minimize maximum weighted tardiness
Recommended article: Q4552014
Recommended article: Fabrication scheduling on a single machine to minimize the weighted sum of product completion time
Recommended article: A note on the single machine CON and CONW problems with lot scheduling
Recommended article: Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
Recommended article: Single-machine lot scheduling with variable lot processing times
Recommended article: Single machine scheduling problem with interval processing times to minimize mean weighted completion time
Recommended article: Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
Recommended article: Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
description: scientific article; zbMATH DE number 6107571