A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times

DOI10.1016/j.cor.2011.08.012zbMath1251.90184OpenAlexW2033097765MaRDI QIDQ1762129

Ming Cheng, Li-Xin Wang, Sarin, Subhash C.

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.012

zbMATH Keywords

branch-and-boundsingle machinecompletion timewafer fabrication\texttt{CPLEX 12.2}multiple-lots-per-carriersingle-wafer-processing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems

Uses Software

• CPLEX

Cites Work

• Batch sizing and job sequencing on a single machine
• Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
• Multiple orders per job batch scheduling with incompatible jobs
• Column generation heuristics for multiple machine, multiple orders per job scheduling problems
• Scheduling multiple orders per job in a single machine to minimize total completion time
• Scheduling with batching: A review
• Principles of Sequencing and Scheduling
• The Batch Loading and Scheduling Problem
• Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling a batch processing machine with non-identical job sizes
• Scheduling Groups of Jobs on a Single Machine