An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization.
Jing-jing WangLing WangPublished in: CASE (2019)
Keyphrases
- total tardiness
- greedy algorithm
- scheduling problem
- flowshop
- total flowtime
- permutation flowshop
- single machine
- objective function
- sequence dependent setup times
- parallel machines
- setup times
- minimizing makespan
- processing times
- special case
- np hard
- maximum lateness
- worst case
- precedence constraints
- tabu search
- flowshop scheduling
- distributed systems
- minimizing total tardiness
- preventive maintenance
- dynamic programming
- knapsack problem
- linear program
- strongly np hard