An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments.
Harlem Mauricio Madrid VilladiegoJosé Elías C. ArroyoAndré Gustavo dos SantosPublished in: EvoCOP (2014)
Keyphrases
- greedy heuristic
- scheduling problem
- lot sizing
- flowshop
- setup times
- np hard
- production planning
- sequence dependent setup times
- lot size
- multi item
- setup cost
- greedy algorithm
- single item
- multistage
- single machine
- processing times
- preventive maintenance
- knapsack problem
- special case
- precedence constraints
- parallel machines
- approximation algorithms
- tabu search
- flowshop scheduling
- maximum lateness
- minimizing makespan
- unrelated parallel machines
- production cost
- lower bound
- strongly np hard
- mixed integer programming
- optimal solution
- lead time
- worst case
- linear programming
- integer programming
- production system
- planning horizon
- lagrangian relaxation
- production scheduling
- reinforcement learning
- dynamic programming
- branch and bound algorithm
- job shop scheduling problem
- production process