An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop.
Wen-Qiang ZouQuan-Ke PanMehmet Fatih TasgetirenPublished in: Appl. Soft Comput. (2021)
Keyphrases
- greedy algorithm
- iterated greedy
- scheduling problem
- permutation flowshop
- greedy algorithms
- worst case
- dynamic programming
- objective function
- greedy strategy
- randomized algorithm
- np hard
- total flowtime
- squeaky wheel
- flowshop
- set cover
- tabu search
- learning algorithm
- greedy heuristic
- approximation guarantees
- computational complexity
- minimizing makespan