Minimizing the Total Completion Time for the TFT-Array Factory Scheduling Problem (TAFSP).
A. H. I. LeeS. H. ChungC. Y. HuangPublished in: ICCSA (1) (2007)
Keyphrases
- scheduling problem
- completion times
- single machine
- flowshop
- absolute deviation
- processing times
- np hard
- tabu search
- setup times
- single machine scheduling problem
- minimizing makespan
- earliness tardiness
- production scheduling
- permutation flowshop
- precedence constraints
- weighted sum
- control system
- queue length
- job shop scheduling problem
- neural network
- release dates
- maximum lateness
- total tardiness
- unrelated parallel machines
- job processing times
- genetic algorithm