The sequencing of “related” jobs
- 1 March 1968
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 15 (1) , 23-32
- https://doi.org/10.1002/nav.3800150103
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.Keywords
This publication has 1 reference indexed in Scilit:
- On the Job-Shop Scheduling ProblemOperations Research, 1960