摘要
本文讨论了m台机器的FolwShop成组排序问题,工件在不同机器上的加工时间相同,目标函数为极小化完工时间和。给出了一个多项式时间可解的最优算法。
This paper concerns a scheduling problem in machine(m) flow shop of group technology with identical processing times on each machine. The objective function is to minimize total completion time. This problem can be solved by a polynomial algorithm.
出处
《运筹与管理》
CSCD
2003年第2期53-55,共3页
Operations Research and Management Science
