Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time

Yau-Ren Shiau, Ming-Shua Tsai,Wen-Chiung Lee,T.C.E. Cheng

Computers & Industrial Engineering（2015）

引用 42|浏览7

暂无评分

摘要

•We study a two-agent two-machine flowshop scheduling problem.•The branch-and-bound algorithm can solve problems of up to 20 jobs.•Four genetic algorithms are proposed and evaluated.

查看译文

关键词

Scheduling,Total completion time,Two agent,Two-machine flowshop,Learning effects

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要