A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots.
Biao ZhangQuan-Ke PanLeilei MengXin-Li ZhangYaping RenJun-Qing LiXu-Chu JiangPublished in: Appl. Soft Comput. (2021)
Keyphrases
- scheduling problem
- flowshop
- np hard
- dynamic programming
- makespan minimization
- job shop scheduling problem
- bicriteria
- parallel machines
- objective function
- cost function
- optimal solution
- neural network
- monte carlo
- linear programming
- special case
- lot streaming
- np complete
- processing times
- precedence constraints
- stochastic approximation
- sequence dependent setup times
- iterated local search
- flowshop scheduling