A concise survey of efficiently solvable special cases of the permutation flow-shop problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 17 (1983) no. 2, pp. 105-119. 
@article{RO_1983__17_2_105_0,
     author = {Monma, C. L. and Rinnooy Kan, A. H. G.},
     title = {A concise survey of efficiently solvable special cases of the permutation flow-shop problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {105--119},
     publisher = {EDP-Sciences},
     volume = {17},
     number = {2},
     year = {1983},
     mrnumber = {712120},
     zbl = {0523.90054},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1983__17_2_105_0/}
}
TY  - JOUR
AU  - Monma, C. L.
AU  - Rinnooy Kan, A. H. G.
TI  - A concise survey of efficiently solvable special cases of the permutation flow-shop problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1983
SP  - 105
EP  - 119
VL  - 17
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1983__17_2_105_0/
LA  - en
ID  - RO_1983__17_2_105_0
ER  - 
%0 Journal Article
%A Monma, C. L.
%A Rinnooy Kan, A. H. G.
%T A concise survey of efficiently solvable special cases of the permutation flow-shop problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1983
%P 105-119
%V 17
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1983__17_2_105_0/
%G en
%F RO_1983__17_2_105_0
Monma, C. L.; Rinnooy Kan, A. H. G. A concise survey of efficiently solvable special cases of the permutation flow-shop problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 17 (1983) no. 2, pp. 105-119. http://archive.numdam.org/item/RO_1983__17_2_105_0/

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

2. N. R. Achuthan, A Special Case of the (n/m/F/Fmax) problem, Opsearch, Vol. 14, 1977, pp.71-87. | MR

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

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

6. F. Burns and J. Rooker, Johnson's Three Machine Flow-Shop Conjecture, Operations Research, Vol. 24, 1976, pp. 578-580. | MR | Zbl

7. F. Burns and J. Rooker, Three-State Flow-Shop with Recessive Second State, Operations Research, Vol. 26, 1978, pp. 207-208. | MR | Zbl

8. F. Chin and L. Tsai, On J-maximal and J-minimal Flow-Shop Schedules (toappear). | Zbl

9. D. G. Dannenbring, An Evaluation of Flow-Shop Sequencing Heuristics, Management Science, Vol. 23, 1977, pp.1174-1182. | Zbl

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 | Zbl

11. J. N. D. Gupta, Optimal Schedules for Special Structure Flow-shops, Naval Research Logistics Quarterly, Vol. 22, 1975, pp.255-269. | MR | Zbl

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 | Zbl

14. T. Kurisu, Two-Machine Scheduling under Required Precedence Among Jobs, J. Operations Research Society Japan, Vol. 19, 1976, pp.1-13. | MR | Zbl

15. T. Kurisu, Two-Machine Scheduling under Arbitrary Precedence Constraints, J. Operations Research Society Japan, Vol. 20, 1977, pp.113-131. | MR | Zbl

16. T. Kurisu, Three-Machine Scheduling Problem with Precedence Constraints, J.Operations Research Society Japan, Vol. 20, 1977, pp. 231-242. | MR | Zbl

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

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 | Zbl

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 | Zbl

21. L. G. Mitten, Sequencing n Jobs on Two Machines with Arbitrary Lag Times, Management Science, Vol. 5, 1958, pp. 293-298. | MR | Zbl

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

25. C. L. Monma, Sequencing to Minimize the Maximum Job Cost, Operations Research, Vol. 28, 1980, pp. 942-951. | MR | Zbl

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 | Zbl

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 | Zbl

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

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 | Zbl

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

33. A. H. G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague, 1976. | Zbl

34. J. B. Sidney, The Two-Machine Flow Time Problem with Series-Parallel Precedence Constraints, Operations Research, Vol 27, 1979, pp. 782-791. | MR | Zbl

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

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 | Zbl

37. W. Szwarc, On Some Sequencing Problems, Naval Research Logistics Quarterly,Vol. 15, 1968, pp. 127-155. | Zbl

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

39. W. Szwarc, Optimal Two-Machine Orderings in the 3 x n Flow-Shop Problem, Operations Research, Vol. 25, 1977, pp. 70-77. | MR | Zbl

40. W. Szwarc, Special Cases for the Flow-Shop Problem, Naval Research Logistics Quarterly, Vol. 25, 1977, pp. 70-77. | MR | Zbl

41. W. Szwarc, Permutation Flow-Shop Theory Revisited, Naval Research Logistics Quarterly, Vol. 26, 1978, pp. 557-570. | MR | Zbl

42. W. Szwarc, The Critical Path Approach In the Flow-Shop Problem, Opsearch, Vol. 16, 1979, pp. 98-102. | MR | Zbl