Free Access
Issue
RAIRO-Oper. Res.
Volume 17, Number 2, 1983
Page(s) 105 - 119
DOI https://doi.org/10.1051/ro/1983170201051
Published online 06 February 2017
  • 1. J. O. ACHUGBUE and F. Y. CHIN, Complexity and Solutions of Some Three StageFlow Shop Scheduling Problems, Technical Report 79-7, University of Alberta, Canada, 1979. [Zbl: 0498.90043]
  • 2. N. R. ACHUTHAN, A Special Case of the (n/m/F/Fmax) problem, Opsearch, Vol. 14, 1977, pp.71-87. [MR: 452623]
  • 3. N. R. ACHUTHAN, Flow-Shop Scheduling Problems, Ph. D. Thesis, Indian Statistical Institute, Calcutta, 1980.
  • 4. T. S. ARTHANARY and A. C. MUKHAPADHYAH, A Note on a Paper, by W. Szwarc, Naval Research Logistics Quarterly, Vol. 18, 1971, pp. 135-138. [Zbl: 0217.27301]
  • 5. F. BURNS and J. ROOKER, A Special Case of the 3 x n Flow-Shop Problem, Naval Research Logistics Quarterly, Vol. 22, 1975, pp.811-817. [Zbl: 0344.90023]
  • 6. F. BURNS and J. ROOKER, Johnson's Three Machine Flow-Shop Conjecture, Operations Research, Vol. 24, 1976, pp. 578-580. [MR: 411601] [Zbl: 0336.90027]
  • 7. F. BURNS and J. ROOKER, Three-State Flow-Shop with Recessive Second State, Operations Research, Vol. 26, 1978, pp. 207-208. [MR: 484362] [Zbl: 0371.90062]
  • 8. F. CHIN and L. TSAI, On J-maximal and J-minimal Flow-Shop Schedules (toappear). [Zbl: 0461.68034]
  • 9. D. G. DANNENBRING, An Evaluation of Flow-Shop Sequencing Heuristics, Management Science, Vol. 23, 1977, pp.1174-1182. [Zbl: 0371.90063]
  • 10. M. R. GAREY, D. S. JOHNSON and R. SETHI, The Complexity of Flow-Shop and Job-shop Scheduling, Mathematics of Operations Research, Vol. 1, 1976, pp. 117-129. [MR: 418895] [Zbl: 0396.90041]
  • 11. J. N. D. GUPTA, Optimal Schedules for Special Structure Flow-shops, Naval Research Logistics Quarterly, Vol. 22, 1975, pp.255-269. [MR: 381677] [Zbl: 0336.90028]
  • 12. S. M. JOHNSON, Optimal Two- and Three-Stage Production Schedules with SetupTimes Included, Naval Research Logistics Quarterly, Vol. 1, 1954, pp.61-68.
  • 13. S. M. JOHNSON, Discussion: Sequencing n Jobs on Two Machines with ArbitraryTime Lags, Management Science, Vol. 5, 1959, pp.299-303. [MR: 101165] [Zbl: 0995.90537]
  • 14. T. KURISU, Two-Machine Scheduling under Required Precedence Among Jobs, J. Operations Research Society Japan, Vol. 19, 1976, pp.1-13. [MR: 406466] [Zbl: 0328.90036]
  • 15. T. KURISU, Two-Machine Scheduling under Arbitrary Precedence Constraints, J. Operations Research Society Japan, Vol. 20, 1977, pp.113-131. [MR: 449629] [Zbl: 0367.90076]
  • 16. T. KURISU, Three-Machine Scheduling Problem with Precedence Constraints, J.Operations Research Society Japan, Vol. 20, 1977, pp. 231-242. [MR: 452628] [Zbl: 0365.90078]
  • 17. B. J. LAGEWEG, J. K. LENSTRA and A. H. G. RINNOOY KAN, A General Bounding Scheme for the Permutation Flow-Shop Problem, Operations Research, Vol. 26, 1978, pp. 53-67. [Zbl: 0371.90059]
  • 18. J. K. LENSTRA, A. H. G. RINNOOY KAN and P. BRUCKER, Complexity of Machine Scheduling Problems, Annals Discrete Mathematics, Vol. 1, 1977, pp. 343-362. [MR: 456421] [Zbl: 0353.68067]
  • 19. G. B. MCMAHON, A Study of Algorithms for Industrial Scheduling Problems, Ph. D. thesis, University of South Wales, 1971.
  • 20. Y. MING-I., On the n Job, m Machine Sequencing Problem of Flow-Shop, Operational Research, Vol. 75, North Holland, 1976, pp.179-200. [MR: 449634] [Zbl: 0395.90038]
  • 21. L. G. MITTEN, Sequencing n Jobs on Two Machines with Arbitrary Lag Times, Management Science, Vol. 5, 1958, pp. 293-298. [MR: 101164] [Zbl: 0995.90539]
  • 22. L. G. MITTEN, A Scheduling Problem, J. Industrial Engineering, Vol.10, 1959, pp. 131-135.
  • 23. C. L. MONMA, Optimal m x n Flow Shop Sequencing with Precedence Constraints and Lag Times, Institute of OR, Report 7778, University of Bonn, 1977.
  • 24. C. L. MONMA, The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions, Operations Research, Vol. 27, 1979, pp. 792-797. [Zbl: 0419.90046]
  • 25. C. L. MONMA, Sequencing to Minimize the Maximum Job Cost, Operations Research, Vol. 28, 1980, pp. 942-951. [MR: 584898] [Zbl: 0423.68006]
  • 26. C. L. MONMA and J. B. SIDNEY, Sequencing with Series-Parallel Precedence Constraints, Mathematics of Operations Research, Vol. 4, 1979, pp. 215-224. [MR: 539402] [Zbl: 0437.90047]
  • 27. I. NABESHIMA, The Order of n Items Processed on m Machines [I], J. Operations Research Society Japan, Vol. 3, 1961, pp. 170-175.
  • 28. I. NABESHIMA, The Order of n Items Processed on m Machines [II], J. Operations Research Society Japan, Vol. 4, 1961, pp. 1-8. [MR: 790788] [Zbl: 0388.90034]
  • 29. I. NABESHIMA, Sequencing Two Machines with Start Lag and Stop Lags, J. Operations Research Society Japan, Vol. 5, 1963, pp. 97-101.
  • 30. I. NABESHIMA, Some Extensions of the M-Machine Scheduling Problem, J. Operations Research Society Japan, Vol. 10, 1967, pp. 1-17. [Zbl: 0183.23303]
  • 31. I. NABESHIMA, The Order of n Items Processed on m Machines (III), J. Operations Research Society Japan, Vol. 16, 1973, pp. 163-184. [MR: 452632] [Zbl: 0388.90034]
  • 32. I. NABESHIMA, Notes on the Analytical Results in Flow Shop Scheduling: Part 2, Rep.Univ. Electro-Comm., Vol. 27, 1977, pp. 253-257. [MR: 662508]
  • 33. A. H. G. RINNOOY KAN, Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague, 1976. [Zbl: 0309.90026]
  • 34. J. B. SIDNEY, The Two-Machine Flow Time Problem with Series-Parallel Precedence Constraints, Operations Research, Vol 27, 1979, pp. 782-791. [MR: 542982] [Zbl: 0426.90047]
  • 35. M. L. SMITH, S. S. PANWALKER and R. A. DUDEK, Flow Shop Sequencing with Ordered Processing Time Matrices, Management Science, Vol. 21, 1975, pp. 544-549. [Zbl: 0302.90025]
  • 36. M. L. SMITH, S. S. PANWALKER and R. A. DUDEK, Flow Shop Sequencing Problem with Ordered Processing Time Matrices: A General Case, Naval Research Logistics Quarterly, Vol. 23, 1976, pp. 481-486. [MR: 446477] [Zbl: 0336.90026]
  • 37. W. SZWARC, On Some Sequencing Problems, Naval Research Logistics Quarterly,Vol. 15, 1968, pp. 127-155. [Zbl: 0164.20004]
  • 38. W. SZWARC, Mathematical Aspects of the 3 x n Job-Shop Sequencing Problem, Naval Research Logistics Quarterly, Vol. 21, 1974, pp.145-153 (see also pp. 725-726). [Zbl: 0287.90010]
  • 39. W. SZWARC, Optimal Two-Machine Orderings in the 3 x n Flow-Shop Problem, Operations Research, Vol. 25, 1977, pp. 70-77. [MR: 525215] [Zbl: 0379.90051]
  • 40. W. SZWARC, Special Cases for the Flow-Shop Problem, Naval Research Logistics Quarterly, Vol. 25, 1977, pp. 70-77. [MR: 459596] [Zbl: 0379.90051]
  • 41. W. SZWARC, Permutation Flow-Shop Theory Revisited, Naval Research Logistics Quarterly, Vol. 26, 1978, pp. 557-570. [MR: 518074] [Zbl: 0413.90030]
  • 42. W. SZWARC, The Critical Path Approach In the Flow-Shop Problem, Opsearch, Vol. 16, 1979, pp. 98-102. [MR: 556938] [Zbl: 0436.90060]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.