An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems.
IEEE Transactions on Cybernetics(2018)
摘要
The mixed no-wait flowshop problem with both wait and no-wait constraints has many potential real-life applications. The problem can be regarded as a generalization of the traditional permutation flowshop and the no-wait flowshop. In this paper, we study, for the first time, this scheduling setting with makespan minimization. We first propose a mathematical model and then we design a speed-up make...
更多查看译文
关键词
Job shop scheduling,Mathematical model,Particle swarm optimization,Time complexity,Acceleration,Heuristic algorithms
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要