Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times.
T. C. Edwin ChengBertrand M. T. LinY. TianPublished in: Comput. Oper. Res. (2009)
Keyphrases
- completion times
- flowshop
- weighted sum
- scheduling problem
- maximum tardiness
- bicriteria
- unrelated parallel machines
- processing times
- open shop
- single machine
- special case
- sequence dependent setup times
- maximum lateness
- job processing times
- tabu search
- linear combination
- preventive maintenance
- minimizing makespan
- setup times
- job shop
- objective function
- parallel machines
- shortest processing time
- competitive ratio
- precedence constraints
- identical parallel machines
- strongly np hard
- np hard
- computational complexity