An Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion.
Xianpeng WangLixin TangPublished in: ICSI (1) (2010)
Keyphrases
- total flowtime
- minimizing makespan
- scheduling problem
- permutation flowshop
- flowshop
- flowshop scheduling problems
- flowshop scheduling
- upper bound
- greedy algorithm
- parallel machines
- tabu search
- np hard
- setup times
- single machine
- special case
- neural network
- processing times
- asymptotically optimal
- sequence dependent setup times
- cost function
- reinforcement learning