论文信息 - ON N-JOB, 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH ARBITRARY TIME LAGS AND TRANSPORTATION TIMES OF JOBS

ON N-JOB, 2-MACHINE FLOW-SHOP SCHEDULING PROBLEM WITH ARBITRARY TIME LAGS AND TRANSPORTATION TIMES OF JOBS

This short paper gives solution algorithm of obtaining an optimal sequence to give minimum total elapsed time in a 'n·job, 2-machine' flow-shop scheduling problem in which jobs involve Arbitrary Time Lags (Le. Start Lags and Stop Lags) and Transportation Times. All the times (processing Times, Arbitrary Lags, and Transportation times) are given prior and are of deterministic; nature.

Noor Mohammad | Parkash Lal Maggu | Manohar Lal Smghal | Sri Krishan Yadav

[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[2] L. G. Mitten. Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[3] Selmer Martin Johnson,et al. Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .