Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison

V.B. Aggarwal Department of Computer Science, University of Delhi, Delhi, 110007, India

P.C. Bagga Department of Mathematics, Motilal Nehru College(Univ. of Delhi), New Delhi, 110021, India

K.R. Kalra Department of Mathematics, A.R.S.D. College(Univ. of Delhi), Delhi, 110021, India

References

Johnson , S.M. 1954 . Optimal two-and thee stage production schedule with setup times included . Nav. Res. Log. Quart. , 1 : 61 – 68 .
Google Scholar
Kurisu , T. 1976 . Two Machine scheduling under required precedence among jobs . J. Operations Research Society of Japan , 20 : 1 – 13 .
Google Scholar
Maggu , P.L. and Das , G. 1977 . Equivalent jobs for job-blocks in job sequencing . Opsearch , 14 : 277 – 281 .
Google Scholar
Maggu , P.L. , Das , G. and Kumar , R. 1981 . On equivalent-job for job-block in 2xn sequencing problem with transportation times . J. Operations Research Society of Japan , 24 : 136 – 146 .
Google Scholar
Szwarc , W. 1974 . Mathematical aspects of the 3xn job-shop sequencing problem . Nav. Res. Log. Quart. , 21 : 145 – 153 .
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison

References

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison

References

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date