A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect.
Ameni AzzouzPo-An PanPeng-Hsiang HsuWin-Chin LinShang-Chia LiuLamjed Ben SaidChin-Chia WuPublished in: Soft Comput. (2020)
Keyphrases
- learning effect
- single machine
- scheduling problem
- flowshop
- minimizing makespan
- parallel machines
- processing times
- strongly np hard
- setup times
- learning curve
- completion times
- printed circuit boards
- np hard
- precedence constraints
- learning companion
- release dates
- tabu search
- single machine scheduling problem
- learning theory
- computational complexity
- dynamic programming
- special case