Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags
Published Online:1 Apr 1959https://doi.org/10.1287/mnsc.5.3.299
- Cited by
- European Journal of Operational Research, Vol. 329, No. 3
- Computers, Materials & Continua, Vol. 70, No. 2
- 30 July 2019 | International Journal of Production Research, Vol. 58, No. 13
- Computers & Industrial Engineering, Vol. 107
- Procedia Engineering, Vol. 38
- European Journal of Operational Research, Vol. 198, No. 1
- 4 December 2008 | Journal of Applied and Industrial Mathematics, Vol. 2, No. 4
- 9 March 2006 | International Transactions in Operational Research, Vol. 13, No. 2
- 12 January 2005 | The International Journal of Advanced Manufacturing Technology, Vol. 27, No. 1-2
- Journal of Scheduling, Vol. 7, No. 5
- 1 January 2000 | Journal of Scheduling, Vol. 3, No. 4
- Journal of Global Optimization, Vol. 9, No. 3-4
- Annals of Operations Research, Vol. 57, No. 1
- 8 July 2010 | International Journal of Production Research, Vol. 30, No. 7
- 29 March 2011 | RAIRO - Operations Research, Vol. 24, No. 4
- 29 March 2011 | RAIRO - Operations Research, Vol. 17, No. 2
- IFAC Proceedings Volumes, Vol. 14, No. 2
- 29 March 2011 | RAIRO - Operations Research, Vol. 12, No. 4
- Unternehmensforschung Operations Research - Recherche Opérationnelle, Vol. 8, No. 2
Volume 5, Issue 3
April 1959
Pages 217-358
Article Information
Metrics
Information
- Published Online:April 01, 1959
© 1959 INFORMS
Cite as
S. M. Johnson, (1959) Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags. Management Science 5(3):299-303.
https://doi.org/10.1287/mnsc.5.3.299
