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 (i.e. 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.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Smghal Manohar

  M. S. College

• Maggu Parkash

  Department of Mathematics, M. S. College

• Mohammad Noor

  M. S. College

• Yadav Sri

  Govt. College

• Maggu Parkash

  Department Of Mathematics M. S. College

関連論文

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

スポンサーリンク