Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH).
Albert CorominasRafael PastorPublished in: J. Oper. Res. Soc. (2011)
Keyphrases
- greedy heuristics
- scheduling problem
- greedy algorithms
- flowshop
- greedy algorithm
- single machine
- set cover
- setup times
- tabu search
- precedence constraints
- permutation flowshop
- maximum lateness
- unrelated parallel machines
- job shop
- processing times
- np hard
- sequence dependent setup times
- flowshop scheduling
- parallel machines
- dynamic programming
- minimizing makespan
- lot streaming
- flowshop scheduling problems
- asymptotic optimality
- knapsack problem
- worst case
- buffer allocation
- search algorithm
- reinforcement learning