, Volume 20, Issue 1, pp 36–40 | Cite as

Two machine scheduling problem when passing allowed

  • P. C. Bagga


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:
  1. (a)

    Jobs which are to be processed on only one of the machines.

  2. (b)

    Jobs which require processing on the two machinesA andB in the orderAB; and

  3. (c)

    Jobs which require processing on the two machinesA andB in the orderBA.



Stochastic Process Schedule Problem Probability Theory Economic Theory Elapse Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bagga, P. C.: Minimizing Waiting Time of Jabs over two machine scheduling problem. Defence Science Journal, April 1967.Google Scholar
  2. Johnson, S. M.: Optimal two and three stage production schedule with set up time included. Naval Res. Log. Quart.1, 61–68, 1954.Google Scholar
  3. Jackson, J. R.: An extension of Johnson's results on job lot scheduling. Naval Res. Log. Quart.3, 201–203, 1956.Google Scholar

Copyright information

© Physica-Verlag Rudolf Liebing KG 1973

Authors and Affiliations

  • P. C. Bagga
    • 1
  1. 1.Defence Science LaboratoryMetcalfe HouseDelhi-6India

Personalised recommendations