New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times.
Chen-Yang ChengPourya PourhejazyKuo-Ching YingShi-Yao HuangPublished in: Appl. Soft Comput. (2021)
Keyphrases
- total weighted tardiness
- single machine
- search space
- computational complexity
- simulated annealing
- particle swarm optimization
- sequence dependent setup times
- optimal solution
- worst case
- single machine scheduling problem
- scheduling problem
- reinforcement learning
- parallel algorithm
- dynamic programming
- processing times
- space complexity
- job shop scheduling problem
- cost function