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
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 07:21, 1 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
    0 references
    0 references
    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

    Identifiers