摘要
排序问题即Job-Shop问题是系统优化的典型问题。在小批量、多品种生产,特别是全盘自动化的计算机综合制造系统(CIMS)中,调度的优劣对生产率影响极大。因而找Job-Shop问题的有效算法具有重要意义。
In this paper the branch and bound method proposed by G.H.Brooks et al. is improved for Job-Shop scheduling problems.The computation of bound below nodes is simplified and higher precision is gained. The associated software of this algorithm is completed to obtain the optimal solution for Job-Shop problems on some scale. To guarantee practicability and perfection of this software, an appropriate approch is proposed for NP-complete problems, which is hard to solve on computers.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1991年第1期5-10,共6页
Systems Engineering-Theory & Practice
