Free Access
Issue |
RAIRO-Oper. Res.
Volume 24, Number 4, 1990
|
|
---|---|---|
Page(s) | 315 - 330 | |
DOI | https://doi.org/10.1051/ro/1990240403151 | |
Published online | 06 February 2017 |
- J.P. ASSELIN DE BEAUVILLE, Les sous-programmes de simulation statistique, Revue de statistique appliquée, 1974, XXII, n°4, p. 57-87. [EuDML: 105988] [Google Scholar]
- K.R. BAKER, Introduction to Sequencing and Scheduling, John Wiley and Sons, p. 169 et suivantes, 1974. [Google Scholar]
- H.G. CAMPBELL, R.A. DUDEK et N.L. SMITH, A Heuristic Algorithm for the n Job, m Machine Sequencing Problem, Management Science, 1970, 16, n°10, p. 630-637. [Zbl: 0194.50504] [Google Scholar]
- R.Q. CHEN, Une nouvelle heuristique pour le problème d'ordonnancement en flowshop, Modernisation de management, 1983, n°1, p. 14-16. [Google Scholar]
- DANNENBRING et G. DAVID, An Evaluation of Flowshop Sequencing Heuristics, Management Science, 1977, 23, n°11, p. 1174-1182. [Zbl: 0371.90063] [Google Scholar]
- J.N.D. GUPTA, A General Algorithm for the n x m Scheduling Problem, Int. J. Prod. Res., 1969, 7, p. 241. [Google Scholar]
- J.N.D. GUPTA, A Functional Heuristic Algorithm for the Flowshop Scheduling Problem, Operational Research Quarterly, 1971, 22, n°1, p. 39-47. [Zbl: 0216.26705] [Google Scholar]
- J.N.D. GUPTA, A Heuristic Algorithm for the Flowshop Sequencing Problem, Revue Française d'automatique, informatique et Recherche opérationnelle, 1976, 10, n°6, p. 63-73. [EuDML: 104643] [MR: 446472] [Zbl: 0326.90030] [Google Scholar]
- T.S. HUNDAL et J. PAJGOPAL, An Extension of Palmer's Heuristic for the Flowshop Scheduling Problem, Int. J. Prod. Res. 1988, 26, (6), p. 1119-1124. [Google Scholar]
- S.M. JOHNSON, Optimal Two- and Three-Stage Production Schedules with Setup Times Included, Nav. Res. Log. Q., 1954, 1, n°1, p. 61-68. [Google Scholar]
- S.M. JOHNSON, Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags, Management Science, 1959, 5, n°3, p. 299-303. [MR: 101165] [Zbl: 0995.90537] [Google Scholar]
- J.R. KING et A.S. SPACHIS, Heuristic for Flowshop Scheduling, Int. J. Prod. Res., 1980, 18, (3), p. 345-357. [Google Scholar]
- M. NAWAZ, E. ENSCORE et L. HAM, A Heuristic Algorithm for the m Machine, n Job Flowshop Sequence Problem, Omega, 1983, 11, p.1. [Google Scholar]
- E.S. PAGE, An Approach to the Scheduling of Jobs on Machines J. Roy. Statist. Soc, 1961, 23, p. 484-492. [MR: 148470] [Google Scholar]
- D.S. PALMER, Sequencing Jobs through a Multi-Stage Process in the Minimum Total Time-a quick Method of Obtaining a Near Optimum, Opl. Res. Q., 16, p.101. [Google Scholar]
- Y. PARK, C. PEGDEN et E. ENSCORE, A Survey and Evaluation of Static Flowshop Scheduling Heuristics, Int. J. Prod. Res., 1984, 22, n°1, p. 127-141. [Zbl: 0541.90055] [Google Scholar]
- PENG SI OW, Focused Scheduling in Proportionate Flowshops, Management Science, 1985, 31, n°7, p. 852-869. [Zbl: 0609.90067] [Google Scholar]
- V.A. PETROV, Flow Line Group Production Planning, London ; Business Publication Ltd., 1966. [Google Scholar]
- C. PROUST, Influence des idées de S.M. Johnson sur la résolution de problème d'ordonnancement de type n/m/F, contraintes diverses/Cmax, Rapport Interne, Labo d'Info. Université de Tours, 1989. [Google Scholar]
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.