Minimizing total completion time in a two-machine flow shop with deteriorating jobs.
Ji-Bo WangC. T. Daniel NgT. C. Edwin ChengLi-Li LiuPublished in: Appl. Math. Comput. (2006)
Keyphrases
- deteriorating jobs
- single machine
- processing times
- scheduling problem
- release times
- single machine scheduling problem
- maximum lateness
- setup times
- release dates
- scheduling jobs
- tabu search
- sequence dependent setup times
- np hard
- learning effect
- dynamic programming
- precedence constraints
- production scheduling
- flowshop
- completion times
- resource consumption
- linear combination
- special case