Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect.
Hongyu HePublished in: Comput. Ind. Eng. (2016)
Keyphrases
- flowshop
- maximum lateness
- scheduling problem
- single machine
- learning effect
- special case
- sequence dependent setup times
- processing times
- setup times
- parallel machines
- release dates
- scheduling jobs
- tabu search
- total weighted tardiness
- minimizing makespan
- np hard
- completion times
- dynamic programming
- precedence constraints
- unrelated parallel machines
- learning companion