CYCLICAL JOB SEQUENCING ON MULTIPLE SETS OF IDENTICAL MACHINES.

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

Research output: Contribution to journalArticlepeer-review

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 sequences. 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.

Original languageEnglish
Pages (from-to)137-151
Number of pages15
JournalNaval Research Logistics
Volume24
Issue number1
DOIs
StatePublished - 1 Jan 1977

Fingerprint

Dive into the research topics of 'CYCLICAL JOB SEQUENCING ON MULTIPLE SETS OF IDENTICAL MACHINES.'. Together they form a unique fingerprint.

Cite this