Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm.
Yuxia PanKaizhou GaoZhi-Wu LiNaiqi WuPublished in: IEEE Trans. Cybern. (2023)
Keyphrases
- scheduling problem
- lot streaming
- flowshop
- np hard
- multistage
- dynamic programming
- computational complexity
- strongly np hard
- shortest path problem
- harmony search algorithm
- optimization algorithm
- cost function
- production system
- special case
- bi objective
- objective function
- optimization method
- benchmark problems
- search space
- minimum cost flow