The sequencing of “related” jobs
作者:
Salah E. Elmaghraby,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1968)
卷期:
Volume 15,
issue 1
页码: 23-32
ISSN:0028-1441
年代: 1968
DOI:10.1002/nav.3800150103
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractGiven n jobs and a single facility, and the fact that a subset of jobs are “related” to each other in such a manner that regardless of which job is completed first, its utility is hampered until all other jobs in the same subset are also completed, it is desired to determine the sequence which minimizes the cost of tardiness. The special case of pairwise relationship among all jobs is easily solved. An algorithm for the general case is given through a dynamic programming formulat
点击下载:
PDF
(671KB)
返 回