A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times.
Subhash C. SarinLixin WangMing ChengPublished in: Comput. Oper. Res. (2012)
Keyphrases
- completion times
- single machine
- scheduling problem
- processing times
- flowshop
- release times
- total tardiness
- sum of completion times
- maximum lateness
- single machine scheduling problem
- earliness tardiness
- total weighted tardiness
- release dates
- setup times
- sequence dependent setup times
- minimize total
- scheduling jobs
- learning effect
- np hard
- production scheduling
- competitive ratio
- weighted sum
- job shop scheduling problem
- number of late jobs
- queue length
- tabu search
- precedence constraints
- parallel machines
- markov chain
- objective function