A note on flow shop scheduling problems with a learning effect on no-idle dominant machines.
MingBao ChengShijie SunYing YuPublished in: Appl. Math. Comput. (2007)
Keyphrases
- flowshop
- learning effect
- scheduling problem
- single machine
- processing times
- total tardiness
- setup times
- flowshop scheduling
- maximum lateness
- sequence dependent setup times
- total weighted tardiness
- np hard
- tabu search
- minimizing makespan
- learning curve
- release dates
- job shop scheduling
- parallel machines
- scheduling jobs
- precedence constraints
- unrelated parallel machines
- permutation flowshop
- job shop
- production scheduling
- special case
- flowshop scheduling problems
- identical machines
- strongly np hard
- single machine scheduling problem
- learning companion
- job shop scheduling problem
- lot streaming
- completion times
- evolutionary algorithm
- lower bound