TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
Author:
Open Access
- 1 January 1977
- journal article
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 20 (2) , 113-131
Abstract
Suppose jobs, in the Johnson's two-machine njob flow-shop scheduling problem, Are grouped inte disjoint subsets within which ajob order that may not be preempted is specified. Furthermere,suppose thataprecedence relation between these subsets is given such that the processing of a subset must be completed, on each machine, before the processing of another subset begins on the rnachine. This paper considers a problem to find a sequence in which jobs are to be precessed on the machines in order to minimize the total elapsed time, under such general precedence constraints, from the start of the first job on machlne I until the end of the last job on machine II. An effMcient algorithm to obtain an optimal sequence is given and a sirnple example is shown.Keywords
This publication has 1 reference indexed in Scilit:
- Optimal Sequencing of a Single Machine Subject to Precedence ConstraintsManagement Science, 1973