A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion.
Shang-Chia LiuJiahui DuanWin-Chin LinWen-Hsiang WuJan-Yee KungHau ChenChin-Chia WuPublished in: Asia Pac. J. Oper. Res. (2018)
Keyphrases
- branch and bound algorithm
- learning effect
- precedence constraints
- release times
- single machine
- single machine scheduling problem
- scheduling problem
- learning companion
- lower bound
- np hard
- learning curve
- branch and bound
- release dates
- upper bound
- multi agent
- pedagogical agents
- lower bounding
- optimal solution
- sequence dependent setup times
- upper bounding
- randomly generated problems
- multi agent systems
- maximum lateness
- processing times
- lagrangian relaxation
- combinatorial optimization
- learning activities
- parallel machines
- finding an optimal solution
- flowshop
- strongly np hard
- search algorithm
- dynamic programming
- metadata