no. V2
A heuristic algorithm for the flowshop scheduling problem
Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, Tome 10 (1976) no. V2, pp. 63-73. 
@article{RO_1976__10_2_63_0,
     author = {Gupta, Jatinder N. D.},
     title = {A heuristic algorithm for the flowshop scheduling problem},
     journal = {Revue fran\c{c}aise d'automatique, informatique, recherche op\'erationnelle. Recherche op\'erationnelle},
     pages = {63--73},
     publisher = {EDP-Sciences},
     volume = {10},
     number = {V2},
     year = {1976},
     mrnumber = {446472},
     zbl = {0326.90030},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1976__10_2_63_0/}
}
TY  - JOUR
AU  - Gupta, Jatinder N. D.
TI  - A heuristic algorithm for the flowshop scheduling problem
JO  - Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle
PY  - 1976
SP  - 63
EP  - 73
VL  - 10
IS  - V2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1976__10_2_63_0/
LA  - en
ID  - RO_1976__10_2_63_0
ER  - 
%0 Journal Article
%A Gupta, Jatinder N. D.
%T A heuristic algorithm for the flowshop scheduling problem
%J Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle
%D 1976
%P 63-73
%V 10
%N V2
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1976__10_2_63_0/
%G en
%F RO_1976__10_2_63_0
Gupta, Jatinder N. D. A heuristic algorithm for the flowshop scheduling problem. Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, Tome 10 (1976) no. V2, pp. 63-73. http://archive.numdam.org/item/RO_1976__10_2_63_0/

1. S. Ashour, A Branch and Bound Algorithm for the Flowshop Scheduling Problems, A.I.I.E. Transactions, 2, No. 2, 1970, pp. 171-178.

2. S. Ashour, An Experimental Investigation and Comparative Evaluation of Flowshop Scheduling Techniques, Opérations Research, 18, No. 3, 1970, pp. 541-549. | Zbl

3. M. K. Bakshi and S. R. Arora, The Sequencing Problem, Management Science, 16, No. 4, 1969, B247-B263. | Zbl

4. A. P. G. Brown and Z. A. Lomnicki, Some Applications of the 'Branch and Bound' Algorithm to the Machine Scheduling Problem, Operational Research Quarterly, 17, No. 2, 1966, pp. 173-186.

5. H. G. Campbell, R. A. Dudek and M. L. Smith, A Heuristic Algorithm for the n Job, m Machine Sequencing Problem, Management Science, 16, No. 10 1970, B630-B637. | Zbl

6. R. A. Dukek and O. F. Tueton Jr., Development of M-Stage Dedision Rule for Scheduling n Jobs through m Machines, Operations Research, 12, No. 3, 1964, pp. 471-497. | Zbl

7. R. H. Gregory and R. L. Van Horn, Automatic Data-Processing Systems, Wadsworth Publishing Company, Inc., Belmont, California, Chapter 13, 1963.

8. J. N.D. Gupta, A General Algotithm for the n x M Flowshop Scheduling Problem, The International Journal of Production Research, 7, No. 3, 1969, pp. 241-247.

9. J. N. D. Gupta, M-Stage Flowshop Scheduling by Branch and Bound, Opsearch, (India), 7, No. 1, 1970, pp. 37-43.

10. J. N. D. Gupta, A Functional Heuristic Algorithm for the Flowshop Scheduling Problem, Operational Research Quarterly, 22, No. 1, 1971, pp. 39-47. | Zbl

11. J. N. D. Gupta, M-Stage Scheduling Problem-A Critical Appraisal, The International Journal of Production Research, 8, No. 2, 1971, pp. 276-281.

12. J. N. D. Gupta, An Improved Combinatorial Algorithm for the Flowshop Scheduling Problem, Operations Research, 19,No.6, 1971, pp. 1753-1758. | Zbl

13. J. N. D. Gupta, Optimal Scheduling in a Multi-Stage Flowshop, A.I.I.E. Transactions, 4, No.2, 1972, pp. 238-243

14. S. M. Johnson, Optimal Two-and Three Stage Production Schedules with Set-Up Times Uncluded, Naval Research Logistics Quarterly, 1, No 1, 1954, pp. 61-68.

15. G. B. Mcmahon, Optimal Production Schedules for Flowshops, Canadian Operations Research Society Journal, 7, 1969, pp. 141-151. | MR | Zbl

16. E. S. Page, An Approach to the Scheduling of Jobs on Machines, Journal of Royal Statistical Society, Series B, 23, No. 2, 1961, pp. 484-492. | MR

17. D. S. Palmer, Sequencing Jobs Through a Multi-Stage Process in the MinimumTotal Time-A Quick Method of Obtaining a Near Optimum, Operational Research Quarterly, 16, No. 1, 1965, pp. 101-107.

18. R. L. Sisson, Sequencing Theory, Chapter 7 in Progress in Operations Research, R. L. ACKOFF (ed.) 1, John Wiley and Sons, Inc., New York, 1961, pp.295-325. | MR

19 R. D. Smith and R. A. Dudek, A General Algorithm for the Solution of the n-Job, m-Machine Sequencing Problem of the Flowshop, Operations Research,15,No. 1, 1967, 71-82 | Zbl

19 R. D. Smith and R. A. Dudek, ( Also see their Errata, Operations Research, 17, 1969, p.756). | Zbl

20. W. Szwarc, Elimination Methods in the m x n Sequencing Problem, Naval Research Logistics Quarterly, 18, No. 3, 1971, pp.295-305. | MR | Zbl

21. W. Szwarc, Optimal Elimination Methods in the m x n Flowshop Scheduling Problem, Operations Research, 21, No. 6, 1973, pp. 1250-1259. | MR | Zbl