A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (Q1762129): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q161752 |
Changed an Item |
||
| Property / author | |||
| Property / author: Sarin, Subhash C. / rank | |||
Normal rank | |||
Revision as of 18:38, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times |
scientific article |
Statements
A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times (English)
0 references
15 November 2012
0 references
single machine
0 references
wafer fabrication
0 references
multiple-lots-per-carrier
0 references
single-wafer-processing
0 references
branch-and-bound
0 references
completion time
0 references
\texttt{CPLEX 12.2}
0 references
