| Abstrakt: |
Bagga [1967] andJohnson [1954] developed algorithms for finding an optimum sequence, whenn jobs require processing on two machines. The criteria chosen by them were minimum waiting time of jobs and minimum elapsed time respectively. All then jobs were assumed to be of the same type i.e., all have to be processed on two machinesA andB in the orderAB. This paper presents a procedure for finding the optimal schedule of the jobs, when the jobs may be of the following types:(a)Jobs which are to be processed on only one of the machines.(b)Jobs which require processing on the two machinesA andB in the orderAB; and(c)Jobs which require processing on the two machinesA andB in the orderBA. |
Full text from SpringerLink