Job—Shop问题的算法及软件设计

眭洁

系统工程理论与实践 ›› 1991, Vol. 11 ›› Issue (1) : 0-0.

PDF(440 KB)
PDF(440 KB)
系统工程理论与实践 ›› 1991, Vol. 11 ›› Issue (1) : 0-0. DOI: 10.12011/1000-6788(1991)1-106356
论文

Job—Shop问题的算法及软件设计

    眭洁
作者信息 +

An Algorithm and Software Design for Job-Shop Poblems

    Sui Jie Jiang Zuolian
Author information +
文章历史 +

摘要

<正> 排序问题即Job-Shop问题是系统优化的典型问题。在小批量、多品种生产,特别是全盘自动化的计算机综合制造系统(CIMS)中,调度的优劣对生产率影响极大。因而找Job-Shop问题的有效算法具有重要意义。

Abstract

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 c

关键词

Key words

引用本文

导出引用
眭洁 . Job—Shop问题的算法及软件设计. 系统工程理论与实践, 1991, 11(1): 0-0 https://doi.org/10.12011/1000-6788(1991)1-106356
Sui Jie Jiang Zuolian . An Algorithm and Software Design for Job-Shop Poblems. Systems Engineering - Theory & Practice, 1991, 11(1): 0-0 https://doi.org/10.12011/1000-6788(1991)1-106356
PDF(440 KB)

252

Accesses

0

Citation

Detail

段落导航
相关文章

/