Improved Sub-gradient Algorithm for Solving the Lower Bound of No-Wait Flow-Shop Scheduling with Sequence-Dependent Setup Times and Release Dates.
Nai-Kang YuRong HuBin QianZi-Qi ZhangLing WangPublished in: ICIC (3) (2018)
Keyphrases
- release dates
- sequence dependent setup times
- single machine scheduling problem
- parallel machines
- single machine
- competitive ratio
- scheduling problem
- strongly np hard
- total weighted tardiness
- lower bound
- minimize total
- worst case
- processing times
- precedence constraints
- optimal solution
- np hard
- dynamic programming
- objective function
- branch and bound algorithm
- setup times
- particle swarm optimization
- upper bound
- special case
- maximum lateness
- combinatorial optimization
- hybrid algorithm
- ant colony optimization
- optimization problems
- supply chain
- computational complexity