A polynomial time approximation scheme for the scheduling problem in the AGV system.
Xinrui LiChaoyang WangHao HuYanxue LiangPublished in: IROS (2022)
Keyphrases
- polynomial time approximation
- np hard
- makespan minimization
- scheduling problem
- approximation algorithms
- error bounds
- identical machines
- special case
- single machine
- linear programming
- optimal solution
- flowshop
- branch and bound algorithm
- permutation flowshop
- worst case
- lower bound
- integer programming
- linear program
- genetic algorithm
- knapsack problem
- constraint satisfaction problems
- tabu search
- upper bound
- bin packing
- setup times
- flexible manufacturing systems
- computational complexity
- minimizing makespan