The sequencing of “related” jobs

Salah E. Elmaghraby

Naval Research Logistics Quarterly, 1968, vol. 15, issue 1, 23-32

Abstract: Given 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 formulation.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800150103

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:15:y:1968:i:1:p:23-32

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().