doss
A branch-and-bound approach to the job-shop
scheduling problem
杰克逊的歌曲期刊名称： International Journal of Production Rearch
作者： ASHOUR, SAID,HIREMATH, S. R.makebelieve
schedule
年份： 1973年
期号： 第1期
摘要：The shop scheduling problem with which this paper is concerned is to determine a quence of J jobs on each of the M machines such that the schedule time is minimized. The machine ordering of each job is pre-specified but independent of tho of other jobs. A branch-and-bound algorithm, using a powerful bounding procedure, has been developed for obtaining an optimal solution. An illustrative example is solved. Computational experience with this algorithm shows that it is practical in problems of moderate size. However, for larger problems, the algorithm can be applied without backtracking in w
2020全国英语四六级考试时间hich an optimal or near-optimal solution may be obtained. The quality of solutions obtained by the branch-and-bound algorithm without backtracking has been investigated. The optimal-producing algorithm is compared favourably with
gentle什么意思>crayola
如何提升进店率内容由中国教育图书进出口有限公司引进transcendent
商品英语
