Flowshop-scheduling problems with makespan criterion: A review

International Journal of Production Research

Volumn 43, Issue 14, 2005, Pages 2895-2929

  Reza Hejazi, S ^a   Saghafian, S ^b  

^a ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Ant colony optimization; Dynamic programming; Flowshop; Genetic algorithm; Heuristics; Makespan; Metaheuristics; Simulated annealing; Tabu search

Indexed keywords

DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SIMULATED ANNEALING; SURVEYS;

FLOWSHOP-SCHEDULING PROBLEMS; METAHEURISTICS; TABU SEARCH;

SCHEDULING;

EID: 27844512878     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/0020754050056417     Document Type: Review

References (167)

1. Abadi, I.N.K., Hall, N.G. and Sriskandarajah, C., Minimizing cycle time in a blocking flowshop. Oper. Res., 1996, 48(1), 177-180.
2. Aldowaisan, T. and Allahverdi, A., New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega, 2004, 32, 345-352.
3. Aldowaisan, T. and Allahverdi, A., New heuristics for no-wait flowshops to minimize make-span. Comput. Oper. Res., 2003, 30, 1219-1231.
4. Aldowaisan, T. and Allahverdi, A., Total flowtime in no-wait flowshops with separated set-up times. Comput. Oper. Res., 1988, 25, 757-765.
5. Allahverdi, A., A new heuristic for m-machine flowshop-scheduling problem with bicriteria of makespan and maximum tardiness. Comput. Oper. Res., 2004, 31, 157-180.
6. Allahverdi, A., Scheduling in stochastic flowshops with independent set-up, processing and removal times. Comput. Oper. Res., 1997, 24, 955-960.
7. Allahverdi, A., Two-stage production scheduling with separated set-up times and stochastic breakdowns. J. Oper. Res. Soc., 1995, 46, 896-904.
8. Allahverdi, A. and Al-Anzi, F.S., Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. Comput. Oper. Res., 2002, 29, 971-994.
9. Allahverdi, A. and Aldowaisan, T., No-wait flowshops with bicriteria of makespan and maximum lateness. Eur. J. Oper. Res., 2004, 152, 132-147.
10. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T., A review of scheduling research involving set-up considerations. Omega, 1999, 27, 219-239.
11. Andres, G., Albarracin, J.M., Tormo, G., Vicens, E. and Garcia-Sabater, J.P., Group technology in a hybrid flowshop environment: a case study. Eur. J. Oper. Res., 2005, 167, 272-281.
12. Baker, K.R., Introduction to Sequencing and Scheduling, 1974 (Wiley: New York).
13. Baker, K.R., Scheduling groups of jobs in the two-machine flowshop. Math Comput. Model, 1990, 13, 29-36.
14. max, in Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM'97, 1997, Vol. 1, pp. 429-438.
15. Ben-Daya, M. and Al-Fawzan, M., A tabu search approach for the flow shop scheduling problem. Eur. J. Oper. Res., 1998, 109, 88-95.
16. Bertolissi, E., Heuristic algorithm for scheduling in the no-wait flow-shop. J. Mater. Process. Tech., 2000, 107, 459-465.
17. Bonney, M.C. and Gundry, S.W., Solution to the constrained flowshop sequencing problem. Operat. Res. Quart., 1976, 24, 869-883.
18. Burdett, R.L. and Kozan, E., Evolutionary algorithms for flowshop sequencing with non-unique jobs. Int. Trans. Oper. Res., 2000, 7, 401-418.
19. Campbell, H.G., Dudek, R.A. and Smith, M.L., A heuristic algorithm of the n-job, m-machine sequencing problem. Manag. Sci., 1970, 16, B630-B637.
20. Cao, J. and Bedworth, D.C., Flow shop scheduling in serial multi-product processes with transfer and set-up times. Int. J. Prod. Res., 1992, 30, 1819-1830.
21. Chakravarthy, K. and Rajendran, C., A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization, Prod. Plan. Contr., 1996, 10, 707-714.
22. Chang, P.-C., Hsieh, J.-C. and Lin, S.G., The development of gradual-priority weighting approach for the multi-objective flowshop-scheduling problem. Int. J. Prod. Econ., 2002, 79, 171-183.
23. Cheng, T.C.E., Gupta, J.N.D. and Wang, G., A review of flowshop-scheduling research with set-up times. Prod. Oper. Manag., 2000, 9, 262-282.
24. Conway, R.W., Maxwell, W.L. and Miller, L.W., Theory of Scheduling, 1967 (Addison-Wesley: Reading, MA).
25. Corwin, B.D. and Esogbue, A.O., Two-machine flowshop-scheduling problems with sequence-dependent set-up times: a dynamic programming approach. Naval Res. Logist. Quart., 1974, 21, 515-524.
26. Daniels, R.L. and Chambers, R.J., Multi-objective flow shop scheduling. Naval Res. Logist. Quart., 1990, 37, 981-995.
27. Danneberg, D., Tautenhahn, T. and Werner, F., A comparison of heuristic algorithms for flow shop scheduling problems with set-up times and limited batch size, 1998. Preprint (Otto-von-Guericke University, Magdeburg).
28. Dannenbring, D.G., An evaluation of flow shop sequencing heuristics. Manag. Sci., 1977, 23, 1174-1182.
29. Dorigo, M. and Gambardella, L.M., Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolut. Comput., 1997, 1, 53-66.
30. Dudek, R.A. and Teuton Jr, O.F., Development of m-stage decision rule for scheduling n jobs through m machines. Oper. Res., 1964, 12, 471-497.
31. El-Bouri, A., A hybrid genetic algorithm for flowshop-scheduling. Available online at: http:// www.umoncton.ca/cie/conferences/29thconf/29thICCIE/ papers/paper043.PDF
32. Fink, A. and Vob, S., Applications of modern heuristic search methods to continuous flow-shop scheduling problems. Available online at: http://citeseer.ist.psu.edu/91064.html
33. Framinan, J.M., Leisten, R. and Rajendran, C., Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int. J. Prod. Res., 2003, 41, 121-148.
34. Gangadharan, R. and Rajendran, C., A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Comput. Ind. Eng., 1994, 27, 473-476.
35. Gangadharan, R. and Rajendran, C., Heuristic algorithms for scheduling in the no-wait flow-shop. Int. J. Prod. Econ., 1993, 32, 285-290.
36. Glover, F. and Laguna, M., Tabu Search, 1997 (Kluwer: Boston).
37. Goldberg, D.E., Genetic Algorithms in Search, Optimization, and Machine Learning, 1989 (Addison Wesley: Reading, MA).
38. Goldberg, D.E., Genetic Algorithms, 1988 (Addison Wesley: Reading, MA).
39. Gourgand, M., Grangeon, N. and Norre, S., A contribution to the stochastic flow shop scheduling problem. Eur. J. Oper. Res., 2004, 31, 1891-1909.
40. Grabowski, J. and Pempera, J., New block properties for the permutation flow-shop problem with application in TS. J. Oper. Res. Soc., 2001, 52, 210-220.
41. Grabowski, J. and Wodecki, M., A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res., 2004, 31, 1891-1909.
42. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling: a survey. Annal. Discret. Math., 1979, 5, 287-326.
43. Guinet, A., Efficiency of reductions of job-shop to flow-shop problems. Eur. J. Oper. Res., 2000, 125, 469-485.
44. Gupta, J.N.D., A functional heuristic algorithm for the flow-shop scheduling problem. Oper. Res., 1971, 22, 39-47.
45. Gupta, J.N.D., Flowshop schedules with sequence-dependent set-up times. J. Oper. Res. Soc., 1986, 29, 206-219.
46. Gupta, J.N.D., Flowshop-scheduling with sequence-dependent set-up times, in Proceedings of the ORSA/TIMS National Meeting, Washington, DC, USA, 1988.
47. Gupta, J.N.D. and Darrow, W.P., Approximate schedules for the two-machine flowshop with sequence-dependent set-up times. Indian J. Manag. Sys., 1985, 1, 6-11.
48. Gupta, J.N.D. and Darrow, W.P., The two-machine sequence-dependent flowshop-scheduling problem. Eur. J. Oper. Res., 1986, 24, 439-446.
49. Gupta, J.N.D., Das, S.R. and Ghosh, S., Flowshop Scheduling with Sequence Dependent Setup Times, 1995. Working Paper (Department of Management, Ball State University, Muncie).
50. Gupta, J.N.D. and Dudek, R.A., Optimality criteria for flow shop schedules. AIIE Trans., 1971, 3, 199-205.
51. Gupta, J.N.D., Neppalli, V.R. and Werner, F., Minimizing total flow time in a two-machine flowshop problem with minimum makespan. Int. J. Prod. Econ., 2001, 69, 323-338.
52. Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C., Two-stage no-wait scheduling models with set-up and removal times. Comput. Oper. Res., 1997, 24, 1025-1031.
53. Gupta, J.N.D. and Tunc, E.A., Scheduling a two-stage hybrid flowshop with separable set-up and removal times. Eur. J. Oper. Res., 1994, 77, 415-428.
54. Hall, N.G. and Sriskandarajah, C., A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res., 1996, 44, 510-525.
55. Ham, I., Hitomi, K. and Yoshida, T., Group Technology, 1985 (Kluwer-Nijhoff: Boston).
56. Hitomi, K. and Ham, I., Operations scheduling for group technology applications. CIRP Ann., 1976, 25, 419-422.
57. Hitomi, K., Nakamura, N., Yoshida, T. and Okuda, K., An experimental investigation of group production scheduling, in Proceedings of the 4th International Conference on Production Research, Tokyo, Japan, 1977, pp. 608-617.
58. Ho, J.C. and Chang, Y.L., A new heuristic for the n-job, machine flow-shop problem. Eur. J. Oper. Res., 1991, 52, 194-202.
59. Ishibuchi, M., Misaki, S. and Tanaka, H., Modified simulated annealing for the flow shop sequencing problems. Eur. J. Oper. Res., 1995, 81, 388-398.
60. Ishibuchi, H. and Murata, H., Multi-objective genetic local search algorithm and its applications to flowshop-scheduling. IEEE Trans. Sys. Man Cybern., 1998, 28, 392-403.
61. Iyer, S.K. and Saxena, B., Improved genetic algorithm for the permutation flowshop-scheduling problem. Comput. Oper. Res., 2004, 31, 593-606.
62. Jin, Y., Okabe, T. and Sendhoff, B., Adapting weighted aggregation for multiobjective evolutionary strategies, in Proceedings of the First Conference on Evolutionary Multi-Criterion Optimization, 2001, pp. 96-110.
63. Johnson, S.M., Optimal two- and three-stage production schedules with set-up times included. Naval Res. Logist. Quart., 1954, 1, 61-68.
64. Khurana, K. and Bagga, P.C., Scheduling of job-block with deadline in nX2 flowshop problem with separated set-up times. Indian J. Pure Appl. Math., 1985, 16, 213-224.
65. Khurana, K. and Bagga, P.C., Minimizing the makespan in a two-machine flowshop with time lags and set-up conditions. Z. Oper. Res., 1984, 28, 163-174.
66. Kim, Y.D., Heuristics for a flowshop-scheduling problems minimizing mean tardiness. J. Oper. Res. Soc., 1993, 44, 19-28.
67. King, J.R. and Spachis, A.S., Heuristics for flow-shop scheduling. Int. J. Prod. Res., 1980, 18, 345-357.
68. Kirkpatrick, S., Gellat, C.D. and Vecchi, M.P., Optimization by simulated annealing. Science, 1983, 220, 671-680.
69. Koulamas, C., A new constructive heuristic for a flowshop-scheduling problem. Eur. J. Oper. Res., 1998, 105, 66-71.
70. Koulamas, C. and Kyparisis, G.J., Concurrent flowshop-scheduling to minimize makespan. Eur. J. Oper. Res., 2004, 156, 524-529.
71. Laarhoven, V.P. J.M. and Aarts, E.H.L., Simulated Annealing: Theory and Applications, 1988 (Kluwer: Dordrecht).
72. Lee, C.-Y., Cheng, T.C.E. and Lin, B.M.T., Minimizing the makespan in the 3-machine assembly-type flowshop-scheduling problem. Manag. Sci., 1993, 39, 616-625.
73. Lee, I. and Shaw, M.J., A neural-net approach to real-time flow-shop sequencing. Comput. Ind. Eng., 2000, 38, 125-147.
74. Leisten, R., Flow-shop sequencing problems with limited buffer storage. Int. J. Prod. Res., 1990, 28, 2085-2100.
75. Li, S., A hybrid two-stage flowshop with part family, batch production, major and minor set-ups. Eur. J. Oper. Res., 1997, 102, 142-156.
76. Liu, J., Controlling the parameters in simulated annealing for flowshop-scheduling, in Proceedings of the 14th International Conference of Production Research, 1997, pp. 1478-1481.
77. Liu, J., The impact of neighbourhood size on the process of simulated annealing: computational experiments on the flowshop-scheduling problem. Comput. Ind. Eng. 1999, 37, 285-288.
78. Logendran, R. and Sriskandarajah, C., Two-machine group scheduling problem with blocking and anticipatory set-ups. Eur. J. Oper. Res., 1993, 69, 467-481.
79. Lomnicki, Z.A., A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem. Operat. Res. Quart., 1965, 16, 89-100.
80. Merkle, D. and Middendorf, M., An ant algorithm with a new pheromone evaluation rule for total tardiness problems, in Proceedings of the EvoWorkshops, Springer, Berlin, 2000, pp. 287-296.
81. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E., Equation of state calculations by fast computing machines. J. Chem. Phys., 1953, 21, 1087-1092.
82. Moccellin, J.A.V., A new heuristic method for the permutation flow shop scheduling problem. J. Oper. Res. Soc., 1995, 46, 883-886.
83. Murata, T., Ishibuchi, H. and Tanaka, H., Multi-objective genetic algorithm and its applications to flowshop-scheduling. Comput. Ind. Eng. 1996, 30, 957-968.
84. Nabeshima, I. and Maruyama, S., Two- and three-machine flowshop makespan scheduling problems with additional times separated from processing times. J. Oper. Res. Soc., 1984, 27, 348-366.
85. Nagar, A., Haddock, J. and Heragu, S., Multiple and bicriteria scheduling: a literature survey. Eur. J. Oper. Res., 1995, 81, 88-104.
86. Nagar, A., Heragu, S.S. and Haddock, J., A combined branch-and-bound and genetic algorithm based approach for a flowshop-scheduling problem. Annal. Oper. Res., 1996, 63, 397-414.
87. Nawaz, M., Enscore Jr, E. and Ham, I., A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA Int. J. Manag. Sci., 1983, 11, 91-95.
88. Negenman, E.G., Local search algorithms for the multiprocessor flow shop scheduling problem. Eur. J. Oper. Res., 2001, 128, 147-158.
89. Neppalli, V.R., Chen, C.L. and Gupta, J.N.D., Genetic algorithms for the two-stage bicriteria flowshop problem. Eur. J. Oper. Res., 1996, 95, 356-373.
90. Nowicki, E., The permutation flow shop with buffers: a tabu search approach. Eur. J. Oper. Res., 1999, 116, 205-219.
91. Nowicki, E. and Smutnicki, C., A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res., 1996, 91, 160-175.
92. Ogbu, F.A. and Smith, D.K., Simulated annealing for the permutation flowshop problem. Omega, 1991, 19, 64-67.
93. max flowshop problem. Comput. Oper. Res., 1990, 17, 243-253.
94. Osman, I.H. and Potts, C.N., Simulated annealing for permutation flow-shop scheduling. Omega, 1989, 17, 551-557.
95. Palmer, D.S., Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near optimum. Oper. Res. Quart., 1965, 16, 101-107.
96. Panwalker, S.S., Dudek, R.A. and Smith, M.L., Sequencing research and the industrial scheduling problem. In Symposium on the Theory of Scheduling and its Applications, edited by S.E. Elmaghraby, pp. 29-38, 1973 (Springer: New York).
97. Park, T. and Steudel, H.J., Analysis of heuristics for job sequencing in manufacturing flow line work-cells. Comput. Ind. Eng., 1991, 20, 129-140.
98. Pinedo, M., Scheduling: Theory, Algorithms and Systems, 2nd edn, 2002 (Prentice-Hall: Englewood Cliffs, NJ).
99. Ponnambalam, S.G., Aravindan, P. and Chandrasekaran, S., Constructive and improvement flow shop scheduling heuristics: an extensive evaluation. Prod. Plan. Contr., 2001, 12, 335-344.
100. Popadirnitriou, C. and Kanellaksi, P.C., Flowshop-scheduling with limited temporary storage. J. Assoc. Comput. Mach., 1980, 27, 533-549.
101. Potts, C.N., Sevastjanov, S.V., Strusevich, V.A., Wassenhove, L.N. and Zwaneveld, C.M., The two-stage assembly scheduling problem: complexity and approximation. Oper. Res., 1995, 43, 346-355.
102. Potts, O.N., An adaptive branching rule for permutation flow-shop problem. Eur. J. Oper. Res., 1980, 8, 19-25.
103. Pour, H.D., A new heuristic for the n-job m-machine flow-shop problem. Prod. Plan. Contr., 2001, 12, 648-653.
104. Presman, E.L., Sethi, S.P., Zhang, H. and Bisi, A., Average cost optimal policy for a stochastic two-machine flowshop with limited work-in-process. Nonlinear Analysis, 2001, 47, 5671-5678.
105. Proust, C., Gupta, J.N.D. and Deschamps, V., Flowshop-scheduling with set-up, processing and removal times separated. Int. J. Prod. Res., 1991, 29, 479-493.
106. Raaymakers, W.H.M. and Weijters, A.J.M.M., Makespan estimation in batch process industries: A comparison between regression analysis and neural networks. Eur. J. Oper. Res., 2003, 145, 14-30.
107. Rajagopalan, D. and Karimi, I.A., Scheduling in serial mixed storage multiproduct processes with transfer and set-up times. In Foundations of Computer Aided Process Operations, edited by G.V. Reklaitis, and H.D. Spriggs, pp. 679-686, 1987 (Elsevier: New York).
108. Rajendran, C., A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. Int. J. Prod. Res., 1994, 3, 2541-2558.
109. Rajendran, C., Heuristics for scheduling in flowshop with multiple objectives. Eur. J. Oper. Res., 1995, 82, 540-555.
110. Rajendran, C., Two-stage flowshop-scheduling problem with bicriteria. J. Oper. Res. Soc., 1992, 43, 871-884.
111. Rajendran, C. and Ziegler, H., Heuristics for scheduling in a flowshop with set-up, processing, and removal times separated. Prod. Plan. Contr., 1997, 8, 568-576.
112. Rajendran, C. and Ziegler, H., Ant-colony algorithms for permutation flowshop-scheduling to minimize makespan/total flowtime of jobs. Eur. J. Oper. Res., 2004, 155, 426-438.
113. Ramanan, G.V. and Rajendran, C., Scheduling in Kanban-controlled flowshops to minimize makespan of containers. Int. J. Adv. Manuf. Tech., 2003, 21, 348-354.
114. Reddi, S.S. and Ramamoorthy, C.V., On the flowshop sequencing with no wait-in-process. Operat. Res. Quart., 1972, 23, 323-331.
115. Reeves, C., A genetic algorithm for flowshop sequencing. Comput. Oper. Res., 1995, 22, 5-13.
116. Reeves, C. and Yamada, T., Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol. Comput., 1998, 6, 45-60.
117. Reeves, C.R., Improving the efficiency of tabu search for machine scheduling problems. J. Oper. Res. Soc., 1993, 44, 375-382.
118. Rinnooy Kan, A.H.G., Machine Scheduling Problems: Classification, Complexity and Computations, 1976 (Martinus Nijhoff: The Hague).
119. Rios-Mercado, R.Z. and Bard, F.B., Computational experience with a branch-and-cut algorithm for flowshop-scheduling with set-ups. Comput. Oper. Res., 1988, 25, 351-366.
120. Rios-Mercado, R.Z. and Bard, F.B., The Flowshop Scheduling Polyhedron with Setup Times. Technical Report ORP96-07, 1996 (Graduate Program in Operations Research, University of Texas at Austin).
121. Rock, H., The three-machine no-wait flowshop is NP-complete. J. Assoc Comput. Mach., 1984, 31, 336-345.
122. Ruiz, R. and Maroto, C., A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res., 2005, 165, 479-494.
123. Ruiz, R., Maroto, C. and Alcaraz, J., Solving the flowshop-scheduling problem with sequence-dependent set-up times using advanced metaheuristics. Eur. J. Oper. Res., 2004 (in press).
124. max Problem. Eur. J. Oper. Res., 2004 (in press).
125. Salhi, S., Designing tabu list size and aspiration criterion within tabu search methods. Comput. Oper. Res., 2002, 29, 67-86.
126. Sarin, S. and Lefoka, M., Scheduling heuristic for the n-job m-machine flow shop. Omega, 1993, 21, 229-234.
127. Schaller, J.E., Gupta, J.N.D. and Vakharia, A.J., Group scheduling with sequence-dependent set-ups, in Proceedings of the Annual Decision Sciences Institute Meeting, San Diego, CA, 1997, pp. 1141-1143.
128. Simons, J.V., Heuristics in flow shop scheduling with sequence-dependent set-up times. Omega, 1992, 20, 215-225.
129. Skorin-Kapov, J. and Vakharia, A.J., Scheduling a flow-line manufacturing cell: a tabu search approach. Int. J. Prod. Res., 1993, 31, 1721-1734.
130. Solimanpur, M., Vrat, P. and Shankar, R., A neuro-tabu search heuristic for the flow shop scheduling problem. Comput. Oper. Res., 2004, 31, 2151-2164.
131. Sotoskov, Y.N., Tautenhahn, T. and Werner, F., Heuristics for permutation flowshop-scheduling with batch set-up times. OR Spektrum, 1996, 18, 67-80.
132. Sridhar, J. and Rajendran, C., A genetic algorithm for family and job scheduling a flowline based manufacturing cell. Comput. Ind. Eng., 1994, 27, 469-472.
133. Sridhar, J. and Rajendran, C., Scheduling in flowshop and cellular manufacturing systems with multiple objectives, a genetic algorithmic approach. Prod. Plan. Contr., 1996, 7, 374-382.
134. Stafford, E.F. and Tseng, F.T., On the Srikar-Ghosh MILP model for the N X M SDST flowshop problem. Int. J. Prod. Res., 1990, 28, 1817-1830.
135. Stafford, E.F. and Tseng, F.T., Two MILP models for the SSIST flowshop sequencing problem, paper presented at DSI National Meetings, 17-20 November 2001.
136. Stafford, E.F. and Tseng, T.F., Two models for a family of flowshop sequencing problems. Eur. J. Oper. Res., 2002, 142, 282-293.
137. Stinson, J.P., Smith, A.W., A heuristic programming procedure for sequencing the static flowshop. Int. J. Prod. Res., 1982, 20, 753-764.
138. Stützle, T., An ant approach for the flow shop problem. In EUFIT'98, Aaeban, Germany, pp. 1560-1564, 1998,
139. Sule, D.R., Sequencing n jobs on two machines with set-up, processing and removal times separated. Naval Res. Logist. Quart., 1982, 29, 517-519.
140. Sule, D.R. and Huang, K.Y., Sequence on two and three machines with set-up, processing and removal times separated. Int. J. Prod. Res., 1983, 21, 723-732.
141. Sung, C.S. and Min, J.I., Scheduling in a two-machine flowshop with batch processing machine (s) for earliness/tardiness measure under a common due date. Eur. J. Oper. Res., 2001, 131, 95-106.
142. Szwarc, W., Flowshop problems with time-lags. Manag. Sci., 1983, 29, 477-481.
143. Szwarc, W., The flowshop problem with time lags and separated set-up times. ZOR-Z Oper. Res., 1986, 30, B15-B22.
144. Szwarc, W. and Gupta, J.N.D., A flow-shop problem with sequence-dependent additive set-up times. Naval Res. Log., 1987, 34, 619-627.
145. T'kindt, V. and Billaut, J.-C., Multicriteria scheduling problems: a survey. RAIRO Oper. Res., 2001, 35, 143-163.
146. T'kindt, V., Gupta, J.N.D. and Billuat, J.-C., Two-machine flowshop-scheduling with a secondary criterion. Comput. Oper. Res., 2003, 30, 505-526.
147. T'kindt, V., Monmarch, N., Tercinet, F. and Laugt, D., An Ant Colony optimization algorithm to solve a (2) machine bicriteria flowshop-scheduling problem. Eur. J. Oper. Res., 2002, 142, 250-257.
148. Taillard, E., Benchmarks for basic scheduling problems. Eur. J. Oper. Res., 1993, 64, 278-285.
149. Taillard, E., Some efficient heuristic methods for the flow-shop sequencing problem. Eur. J. Oper. Res., 1990, 47, 65-74.
150. Tanarv, V.S., Sotskov, Y.N. and Strusevitch, V.A., Scheduling Theory Multi-stage System, 1994 (Kluwer: Dordrecht).
151. Tang, C.S., Scheduling batches on parallel machines with major and minor set-ups. Eur. J. Oper. Res., 1990, 46, 28-37.
152. Townsend, W., Sequencing n jobs on m machines to minimize maximum tardiness: a branch-and-bound solution. Manag. Sci., 1977, 23, 1016-1019.
153. Tseng, F.T. and Stafford, E.F., Two MILP models for the N X M SDST flowshop sequencing problem. Int. J. Prod. Res., 2001, 39, 1777-1809.
154. Turner, B. and Booth, D., Comparison of heuristics for flow shop sequencing. OMEGA Int. J. Manag. Sci., 1987, 15, 75-78.
155. Uskup, G. and Smith, S.B., A branch-and-bound for two-stage production sequencing. Oper. Res., 1975, 23, 118-136.
156. Vakharia, A.J. and Chang, Y.-L., A simulated annealing approach to scheduling a manufacturing cell. Naval Res. Log., 1990a, 37, 559-577.
157. Vakharia, A.J. and Chang, Y.-L., Model for the NxM SDST flowshop problem. Int. J. Prod. Res., 1990b, 28, 1817-1830.
158. Vakharia, A.J., Schaller, J.E. and Gupta, J.N.D., Designing and scheduling manufacturing cells, in Proceedings of the INFORMS National Meeting, New Orleans: LA, USA, 1995.
159. Wang, L. and Zheng, D.Z., An effective hybrid heuristic for flow shop scheduling. Int. J. Adv. Manuf. Tech., 2003, 21, 38-44.
160. Whitley, D., Starkweather, T. and D'Ann, F., Scheduling problems and traveling salesman, in Proceedings of the Third International Conference on Genetic Algorithms and their Applications, Arlington, VA, USA, 1989, pp. 133-140.
161. Widmer, M. and Hertz, A., A new heuristic method for the flow shop sequencing problem. Eur. J. Oper. Res., 1989, 41, 186-193.
162. Wismer, D.A., Solution of the flowshop sequencing problem with no intermediate queues. Oper. Res., 1972, 20, 689-697.
163. Wodecki, M. and Bozejko, W., Solving the flow shop problem by parallel simulated annealing. In Parallel Processing and Applied Mathematics, edited by R. Wyrzykowski, J. Dongarra, M. Paprzycki and J. Waasniewski, 4th International Conference, PPAM 2001, pp. 236-244, 2002. (Springer: Berlin).
164. Ying, K.C. and Liao, C.J., An ant colony system for permutation flow-shop sequencing. Comput. Oper. Res., 2004, 31, 791-801.
165. Yoshida, T. and Hitomi, K., Optimal two-stage production scheduling with set-up times separated. AIIE Trans., 1979, 11, 261-263.
166. Zdrzalka, S., Two-Machine Flow Shop Scheduling Problem with Family Setup Times. Report No. 16/95, 1995 (Institute of Engineering Cybernetics, Technical University of Wroclaw).
167. Zegordi, S.H., Itoh, K. and Enkawa, T., Minimizing makespan for flowshop-scheduling by combining simulated annealing with sequencing knowledge. Eur. J. Oper. Res., 1995, 85, 515-531.