An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem.
Francisco J. RodríguezManuel LozanoChristian BlumCarlos García-MartínezPublished in: Comput. Oper. Res. (2013)
Keyphrases
- unrelated parallel machines
- greedy algorithm
- scheduling problem
- iterated greedy
- permutation flowshop
- parallel machines
- setup times
- total flowtime
- single machine
- flowshop
- greedy algorithms
- squeaky wheel
- np hard
- processing times
- dynamic programming
- minimizing makespan
- objective function
- job shop scheduling
- worst case
- knapsack problem
- tabu search
- precedence constraints
- job shop scheduling problem
- set cover
- influence maximization
- greedy strategy
- sequence dependent setup times
- strongly np hard
- lot sizing
- genetic algorithm