A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect.
Tamer ErenPublished in: Appl. Math. Comput. (2009)
Keyphrases
- single machine
- learning effect
- maximum lateness
- scheduling problem
- flowshop
- completion times
- sequence dependent setup times
- parallel machine scheduling problem
- processing times
- parallel machines
- release dates
- minimizing makespan
- single machine scheduling problem
- np hard
- setup times
- precedence constraints
- tabu search
- integer programming
- e learning
- dynamic programming