|
Algorithmen für das klassische maschinenbelegungsproblem
作者: Johannes Terno,
期刊:
Mathematische Operationsforschung und Statistik
（Taylor Available online 1972）
页码: 195-201
ISSN:0047-6277
年代: 1972
DOI:10.1080/02331887208801075
出版商: Akademie-Verlag
数据来源: Taylor
摘要: Approximate algorithms for the travelling salesman problem, which is in a direct relationship to the transportation problem, use expedient the reduced cost matrix. This paper deals with a similar fundamental property for the classical job scheduling problem making use of a special formula for the make-span.
点击下载:
|
首页
PDF|
版权所有 © 2009 NSTL国家科技图书文献中心 咨询热线：800-990-8900 010－58882057 Email:service@nstl.gov.cn 地址：北京市复兴路15号 100038 京ICP备05017586号 |