Cyclical job sequencing on multiple sets of identical machines

Helman I. Stern, Edgardo P. Rodriguez and Merlin L. Utter

Naval Research Logistics Quarterly, 1977, vol. 24, issue 1, 137-151

Abstract: The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r−1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0‐1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented.

Date: 1977
References: Add references at CitEc
Citations:

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

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:24:y:1977:i:1:p:137-151

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 ().