Les problèmes d'ordonnancement de type «flow-shop» hybride : état de l'art

 Access to full text

 Full (PDF)

1. [ag-1995] E. H. AGHEZZAF, A. ARTIBA, O. MOURSLI et C. TAHON, Hybrid flowshop problems, a decomposition based heuristic approach. In International Conference on Industrial Ingineering and Production Management (IEPM'95), avril 1995, Marrakech (Maroc), FUCAM/IFIP/INRIA, p. 43-56. 
2. [al-1997] F. ALEXANDRE, C. CARDEIRA, F. CHARPILLET, Z. MAMMERI et M.-C. PORTMANN, Compu-search Methodologies II : Scheduling using Genetic Algorithms and Artificial Neural Networks, dans The Planning and Scheduling of Production System, A. Artiba et S. E. Elmaghraby, Chapman & Hall edition, 1997, p. 301-336. 
3. [ba-1974] K. R. BAKER, Introduction to sequencing and scheduling, John Willey & Sons, Inc., 1974. 
4. [ba-1987] P. BAPTISTE, C. H. CHO, J. FAVREL et M. ZOUHRI, Une caractérisation analytique des ordonnancements admissibles sous contraintes hétérogènes en flow-shop, RAIRO-APII, 1987, 25, p. 87-102. Zbl0726.90034
5. [be-1982] R. BELLMAN, A. O. ESOGBUE et I. NABESHIMA, Mathematical aspects of scheduling and applications, volume 4 of International Series in Modern Applied Mathematics and Computer Science, Pergamon Press edition, 1982. Zbl0498.90018MR680400
6. [ro-1996] J-C. BILLAUT et F. ROUBELLAT, A new method for workshop real time scheduling, Int. J. Prod. Res., 1996, 34, n° 6, p. 1555-1579. Zbl0927.90027
7. [bl-1994] J. BLAZEWICZ, K. ECKER, G. SCHMIDT et J. WEGLARZ, Scheduling in Computer and Manufacturing Systems, Springer-Verlag edition, 1994. Zbl0816.90068
8. [bo-1996] V. BOTTA-GENOULAZ, Planification et ordonnancement d'une succession d'ateliers avec contraintes, PhD thesis, Université Claude Bernard-Lyon 1, décembre 1996. 
9. [br-1991] S. A. BRAH et J. L. HUNSUCKER, Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, 1991, 57, p. 88-99. Zbl0732.90040
10. [br-1975] P. BRATLEY, M. FLORIAN et P. ROBILLARD, Scheduling with earliest start and due date constraints on multiple machines, Naval Research Logistics Quarterly, 1975, 22, n° 1, p. 165-173. Zbl0306.90032
11. [bu-1973] R. E. BUTEN et V. Y. SHEN, A scheduling model for computer Systems with two classes of processors, Sagomore Computer Conference on Parallel Processing, 1973. 
12. [ca-1970] H. G. CAMPBELL, R. A. DUKEK et M. L. SMITH, A heuristic algorithm for the n job, m machine sequencing problem, Management Science, 1970, 16, n° 10, p. B630-B637. Zbl0194.50504
13. [Ca-1988] J. CARLIER et P. CHRETIENNE, Problèmes d'ordonnancement (modélisation/complexité/algorithmes), Études et Recherches en Informatique, Masson édition, 1988. 
14. [ca-1987] J. CARLIER, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, European Journal of Operational Research, 1987, 29, p. 298-306. Zbl0622.90049MR891314
15. [ch-1990] Y.-L. CHANG et R. S., SULLIVAN, Schedule generation in a dynamic job shop, Int. J. Prod. Res., 1990, 28, n° 1, p. 65-74. 
16. [ch-1995] B. CHEN, Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage, Journal of Operational Research Society, 1995, 46, n° 2, p. 234-244. Zbl0827.90070
17. [co-1994] Collectif, « Ordonnancement et Entreprises : applications concrètes et outils pour le futur ». In Journées d'études, Toulouse (France), CNRS/GdR Automatique/pôle SED/GT3. juin 1994, 315 p. 
18. [de-1991] D. E. DEAL et J. L. HUNSUCKER, The two stage flowshop scheduling problem with m machines at each stage, Journal of Information and Optimization Sciences, 1991, 72, p. 407-471. Zbl0825.90544
19. [dj-1996] L. DJERID et M.-C. PORTMANN, Genetic algorithm operators restricted to precedent constraints set: genetic algorithm designs with or without branch and bound approach for solving scheduling problems with disjunctive constraints, Pékin (Chine), IEEE/Systems, Man and Cybernetics (SMC'96), octobre 1996, 4, p. 2922-2927. 
20. [fo-1996] Ph. FORTEMPS, Ch. OST, M. PIRLOT, J. TEGHEM et D. TUYTTENS, A production scheduling case study in a chemical firm using metaheuristics, European Journal of Operational Research, 1996, soumis. 
21. [fo-1993] C. FOURE, D. M GAY et B.W. KERNIGHAN, AMPL: A Modeling Language for Mathematical Programming, The Scientific Press edition, 1993. Zbl0701.90062
22. [go-1993] GOThALes problèmes d'ordonnancement, RAIRO Rech. Opér., 1993, 27, n° 1, p. 77-150. MR1209112
23. [gr-1979] R. L. GRAHAM, E. L. LAWLER, J. K. LENSTRA et A. H. G. RINNOOY KAN, Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Ann. Discrete Math., 1979, 5, p. 287-326. Zbl0411.90044MR558574
24. [gr-1966] R. L. GRAHAM, Bounds for certain multiprocessing anomalies, The Bell System Technical Journal, 1966, 45, p. 1563-1581. Zbl0168.40703
25. [gu-1995] A. GUINET, V. BOTTA et M. SOLOMON, Minimisation du plus grand retard ou de la plus grande date de fin dans les problèmes d'ordonnancement de type flowshop hybride. In Journées d'études: « Affectation et Ordonnancement », Tours (France), CNRS/GdR Automatique/pôle SED/GT3, septembre 1995, p. 95-111. 
26. [gu-1996] A. GUINET, M. M. SOLOMON, P. K. KEDIA et A. DUSSAUCHOY, A computational study of heuristics for two-stage flexible flowshops, Int J. Prod. Res., 1996, 34, n° 5, p. 1399-1415. Zbl0947.90540
27. [gup-1995] J. N. D. GUPTA, A. M. A. HARIRI et C. N. POTTS, Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Mathematics of Industrial Systems (Annals of operations research), 1995, à paraître. Zbl0880.90071
28. [gu-1991] J. N.D. GUPTA et E. A. TUNC, Schedules for a two-stage hybrid flowshop with parallel machines at the second stage, Int. J. Prod. Res., 1991, 29, n° 7, p. 1489-1502. 
29. [gu-1994] J. N. D. GUPTA et E. A. TUNC, Scheduling a two-stage hybrid flowshop with separable setup and removal times, European Journal of Operational Research, 1994, 77, p. 415-428. Zbl0809.90080
30. [gu-1988] J. N. D. GUPTA, Two-stage hybrid flowshop scheduling problem, Operational Research Society, 1988, 39, n° 4, p. 359-364. Zbl0639.90049
31. [ha-1979] R. H. HAYES et S. C. WHEELWRIGHT, Le cycle de vie du processus de production (i) et (ii), Harvard-L'expansion, automne 1979, p. 23-32, 99-110. 
32. [he-1996] H. HENTOUS et A. GUINET, A constraint hybrid flowshop problem. In Workshop on Production Planning and Control (WPPC), septembre 1996, Mons, Belgique, FUCaM/EIASM/ICM, p. 303-306. 
33. [ho-1974] W. A. HORN, Some simple scheduling algorithms, Naval Research Logistics Quarterly, 1974, 21, p. 177-185. Zbl0276.90024MR343895
34. [hu-1992] J. L. HUNSUCKER et J. R. SHAH, Performance of priority rules in a due date flow shop, OMEGA, 1992, 20, n° 1, p. 73-89. 
35. [hu-1994] J. L. HUNSUCKER et J. R. SHAH, Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, European Journal of Operational Research, 1994, 72, p. 102-114. Zbl0800.90570
36. [ig-1965] E. IGNALL et L. SCHRAGE, Application of the branch and bound technique to some flow-shop scheduling problems, Operations Research, 1965, 13, n° 3, p. 400-412. MR192915
37. [jo-l954] S. M. JOHNSON, Optimal two and three stage production schedules with setup times included, Naval Research Logistics Quarterly, 1954, 1, n° 1, p. 61-68. 
38. [ka-1997] S. N. KADIPASAOYLU, W. XIANG et B. M. KHUMAWOLA, A comparison of scheduling rules in static and dynamic hybrid flow Systems, Int. J. Prod. Res., 1997, 35, n° 5, p. 1359-1384. Zbl0942.90519
39. [la-1978] B. J. LAGEWEG, J. K. LENSTRA et A. H. G. RINNOOY KAN, A general bounding scheme for the permutation flow-shop problem, Operations Research, 1978, 26, n° 1, p. 53-67. Zbl0371.90059
40. [la-1987] M. A. LANGSTON, Interstage transportation planning in the deterministic flow-shop environment, Operations Research, 1987, 35, n° 4, p. 556-564. 
41. [la-1994] J.-B. LASSERRE et S. DAUZÈRE-PÉRÈS, Planification et ordonnancement intégrés dans un atelier de type jobshop, Bulletin de liaison n° 8 du CNRS/GdR Automatique/Ple SED/GT3, avril 1994. 
42. [la-1982] R. LAUMAILLE, Pratique de Gestion de Production, Les Editions d'Organisation, 1982. 
43. [la-1989] E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN et D. B. SHMOYS, Sequencing and scheduling: algorithms and complexity, Report BS-R8909, Center for Mathematics and Computer Science, The Netherlands, Amsterdam, 1989, 70 p. 
44. [lee-1993] C. LEE, T. C. E. CHENG et B.M.T. LIN, Minimizing the makespan in the 3-machine assembly flowshop scheduling problem, Management Science, 1993, 39, n° 5, p. 616-625. Zbl0783.90054
45. [lee-1994] C. Y. LEE et G. L. VAIRAKTARAKIS, Minimizing makespan in hybrid flowshop, Operations Research Letters, 1994, 16, n° 3, p. 149-158. Zbl0812.90066MR1306218
46. [le-1992] A. LEGAIT, L'intégration : quels impacts surla spécification d'un système de gestion de production assistée par ordinateur?, PhD thesis, Université de Lyon I-INSA, 1992. 
47. [le-1979] P. LEMOAL et J. C. TARONDEAU, Un défi à la fonction de la production, Revue Française de Gestion, Janvier-Février 1979, p. 9-14. 
48. [le-1994] M.-L. LEVY, P. LOPEZ et B. PRADIN, Characterization of feasible schedules for the flow-shop problem: a decomposition approach. In European Workshop on Integrated Manufacturing Systems Engineering (IMSE'94), Grenoble (France), INRIA, décembre 1994, p. 307-315. 
49. [li-1996] S. LI, A hybrid two-stage flowshop with part family, batch production, major and minor setups, European Journal of Operational Research, 1996à paraître. Zbl0955.90017
50. [ma-1993] B. L. MACCARTHY et J. LIU, Addressing the gapin scheduling research: a review of optimization and heuristic methods in production scheduling, Int. J. Prod. Res., 1993, 31, n° 1, p. 59-79. 
51. [na-1959] R. MACNAUGHTON, Scheduling with deadlines and loss functions, Management Science, 1959, 6, p. 1-12 Zbl1047.90504MR110585
52. [mi-1959] L. G. MITTEN, Sequencing n jobs on two machines with arbitrary time lags, Management Science, 1959, 5, n° 3, p. 293-298. Zbl0995.90539MR101164
53. [mo-1983] C. L. MONMA et A. H. G. RINNOOY KAN, A concise survey of efficiently solvable special cases of the permutation flow-shop problem, RAIRO Rech. Opér., 1983, 17, n° 2, p. 105-119. Zbl0523.90054MR712120
54. [na-1987] S. L. NARASIMHAN et P. M. MANGIAMELI, A comparison of sequencing rules for a two-stage hybrid flowshop, Decision Sciences, 1987, 18, p. 250-265. 
55. [na-1984] S. L. NARASIMHAN et S. S. PANWALKAR, Scheduling in a two stage manufacturing process, Int. J, Prod. Res., 1984, 22, n° 4, p. 555-564. 
56. [na-1983] M. NAWAZ, E. ENSCORE et I. HAM, A heuristic algorithm fort the m machine, n job flowshop sequencing problem, OMEGA, 1983, 11, n° 1, p.91-95. 
57. [pa-1961] S. PAGE, An approach to the scheduling of jobs on machines, J. Roy. Statist. Soc., 1961, 23, p. 484-492. MR148470
58. [pa-1979] R. J. PAUL, A production scheduling problem in the glass-container industry, Operations Research, 1979, 27, n° 2, p. 290-302. 
59. [po-1996] M. C. PORTMANN, A. VIGNIER, D. DARDILHAC et D. DEZALAY, Some hybrid flowshop scheduling by crossing branch and bound and genetic algorithms. In 5th International Workshop on Project Management and Scheduling (PMS'96), Poznan (Pologne), avril 1996, p. 186-189. Zbl0943.90038
60. [po-1988] M.-C PORTMANN, Méthodes de décomposition spatiales et temporelles en ordonnancement de la production, RAIRO-APII, 1988, 22, n° 5, p. 439-451. Zbl0647.90046MR966408
61. [pr-1995] C. PROUST et E. GRUNENBERGER, Planification de production dans un contexte de flow-shop hybride à deux étages : conception et interprogrammation d'ARIANNE 2000, RAPA, 1995, 8, n° 5, p. 715-734. 
62. [pr-1992] C. PROUST, Using Johnson's algorithm for solving flowshop scheduling problems. In Summer school on Scheduling Theory andits Applications, Bonas (France), INRIA/C3/COMETT, octobre 1992, p. 297-342. 
63. [ra-1992b] C. RAJENDRAN et D. CHAUDHURI, A multi-stage parallel processor flowshop problem with minimum flowtime, European Journal of Operational Research, 1992, 57, p. 111-122. Zbl0767.90040
64. [ra-1992a] C. RAJENDRAN et D. CHAUDHURI, Scheduling in n-jobs, m stage flowshop with parallel processors to minimize makespan, Int. J. of Production Economics, 1992, 27, p. 137-143. 
65. [ri-1995] P. RICHARD, C. CAVALIER, N. JACQUET et C. PROUST, Solving scheduling problems using petri nets and constraints logic programming. In International Conference on Emerging Technologies and Factory Automation (ETFA'95), Vol. 1, Paris (France), INRIA/IEEE, octobre 1995, p. 59-68. 
66. [ri-1976] A. H. G. RINNOOY KAN, Machine scheduling problems: classification, complexity and computations, Nijhoff, The Hague, 1976. Zbl0309.90026
67. [sa-1973] M. S. SALVADOR, A solution to a special class of flow shop scheduling problem. In Symposium on the Theory of Scheduling and its Applications Springer-Verlag, Berlin (Allemagne), 1973, p. 83-91. Zbl0297.90036MR398495
68. [sa-1992] E. SANLAVILLE, Conception et analyse d'algorithmes de liste en ordonnancement préemptif, PhD thesis, Université de Paris VI, september 1992. 
69. [sa-1995] D. L. SANTOS, J. L. HUNSUCKER et D. E DEAL, Global lower bounds for flow shop with multiple processors, European Journal of Operational Research, 1995, 80, p. 112-120. Zbl0927.90052
70. [saw-1993] T. J SAWIK, A scheduling algorithm for flexible flow lines with limited intermediate buffers, Applied Stochastic Models and Data Analysis, 1993, 9, p. 127-138. 
71. [saw-1995] T.J. SAWIK, Scheduling flexible flow lines with no in-process buffers, Int. J. Prod. Res., 1995, 33, n° 5, p. 1357-1367. Zbl0916.90156
72. [sh-1972] V.Y. SHEN et Y.E. CHEN, A scheduling strategy for the flowshop problem in a System with two classes of processors. In Conference on Information and Systems Science, 1972, p. 645-649. 
73. [sh-1990] H. D. SHERALI, S. C. SARIN et M. S. KODIALAM, Models and algorithm for a two-stage production process, Production Planning and Control, 1990, 1, n° 1, p. 27-39. 
74. [sr-1989] C. SRISKANDARAJAH et S. P. SETHI, Scheduling algorithms for flexible flow-shops: Worst and average case performance, European Journal of Operational Research, 1989, 43, p. 143-160. Zbl0691.90038MR1033646
75. [st-1990] E. F. STAFFORD et F. T. TSENG, On the Srikar-Ghosh MILP model for the nxm SDST flowshop problem, Int. J. Prod. Res., 1990, 28, n° 10, p. 1817-1830. 
76. [su-1983] D. R. SULE et K. Y. HUANG, Sequency on two and three machines with setup, processing and removal times separated, Int. J. Prod. Res., 1983, 21, n° 5, p. 723-732. Zbl0516.90038
77. [sz-1987] W. SZWARC et J. N. D. GUPTA, A flow-shop problem with sequence-dependant additive setup times, Naval Research Logistics Quarterly, 1987, 23, p. 619-627. Zbl0657.90046MR906425
78. [sz-1983] W. SZWARC, Flowshop problems with time lags, Management Science, 1983, 29, n° 4, p. 477-481. Zbl0513.90036
79. [to-1977] W. TOWNSEND, Sequencing n jobs on m machines to minimize maximum tardiness: a branch and bound solution, Management Science, 1977, 23, n° 9, p. 1016-1019. Zbl0367.90077
80. [va-1994] A. VANDEVELDE, Minimizing the makespan in a multiprocessor flow shop, Master's thesis, avril 1994, 37 p. 
81. [vi-1995] A. VIGNIER, J.-C. BILLAUT et C. PROUST, Les problèmes de flow-shop hybride : état de l'art, Rapport Interne 155, LI/E3i/Univ. de Tours, mai 1995, 100 p. 
82. [vi-1996a] A. VIGNIER, J.-C. BILLAUT et C. PROUST, Solving k-stage hybrid flowshop scheduling problems. In Multiconference on Computational Engineering in Systems Applications (CESA'96), Symposium on Discrete Events and Manufacturing Systems (IEEE-SMC /IMACS), Lille (France), 1996, p. 250-258. Zbl0960.90042
83. [vi-1996b] A. VIGNIER, J.-C. BILLAUT, C. PROUST et V. TKINDT, Resolution of some two stage hybrid flowshop scheduling problems, Pékin (Chine), IEEE/Systems, Man and Cybernetics (SMC'96), octobre 1996, p. 2934-2941. 
84. [vi-1996c] A. VIGNIER, D. DARDILHAC, D. DEZALAY et C. PROUST, A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop. In 5th Internationnal Conference on Emerging Technologies and Factory Automation (ETFA'96), Hawaii (USA), IEEE/SICE, novembre 1996, 1, p. 215-220. 
85. [wi-1985] R. J. WITTROCK, Scheduling algorithms for flexible flow lines, IBM J. Res. Develop., juillet 1985, 29, n° 4, p. 401-412. 
86. [wi-1988] R. J. WITTROCK, An adaptable scheduling algorithm for flexible flow line, OpSearch, 1988, 36, n° 3, p. 445-453. Zbl0646.90039