A cooperative iterated greedy algorithm for the distributed flowshop group robust scheduling problem with uncertain processing times.
Zhi-Yuan WangQuan-Ke PanLiang GaoXue-Lei JingQing SunPublished in: Swarm Evol. Comput. (2023)
Keyphrases
- processing times
- scheduling problem
- flowshop
- greedy algorithm
- total flowtime
- permutation flowshop
- single machine
- minimizing makespan
- makespan minimization
- setup times
- bicriteria
- flowshop scheduling
- maximum lateness
- greedy algorithms
- total weighted tardiness
- earliness tardiness
- special case
- sequence dependent setup times
- release dates
- parallel machines
- tabu search
- objective function
- np hard
- total tardiness
- single machine scheduling problem
- number of tardy jobs
- worst case
- polynomially solvable
- precedence constraints
- job shop
- dynamic programming
- approximation ratio
- job shop scheduling problem
- resource consumption
- strongly np hard
- identical machines
- knapsack problem
- identical parallel machines
- linear programming
- lot sizing
- competitive ratio
- upper bound