No-wait two-machine permutation flow shop scheduling problem with learning effect, common due date and controllable job processing times.
Fu GaoMengqi LiuJian-Jun WangYuan-Yuan LuPublished in: Int. J. Prod. Res. (2018)
Keyphrases
- learning effect
- job processing times
- single machine
- flowshop
- scheduling problem
- processing times
- release dates
- sequence dependent setup times
- makespan minimization
- total weighted tardiness
- setup times
- learning curve
- single machine scheduling problem
- special case
- dynamic programming
- parallel machines
- tabu search
- np hard
- learning tools
- polynomially solvable
- computational complexity