Scheduling in flowshops with no-idle machines

Studies in Computational Intelligence

Volumn 230, Issue , 2009, Pages 21-51

  Ruiz, Rubén ^a   Vallada, Eva ^a   Fernández Martínez, Carlos ^a  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78049253971     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-02836-6_2     Document Type: Article

References (62)

1. Adiri, I., Pohoryles, D.: Flowshop no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics 29(3), 495-504 (1982)
2. Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)
3. max. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1997, Lyon, France, vol. 1, pp. 429-438 (1997)
4. Baraz, D., Mosheiov, G.: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. European Journal of Operational Research 184(2), 810-813 (2008)
5. Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science 16(10), 630-637 (1970)
6. Cheng, M.B., Sun, S.J., He, L.M.: Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines. European Journal of Operational Research 183(1), 115-124 (2007a)
7. Cheng, M.B., Sun, S.J., Yu, Y.: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines. Applied Mathematics and Computation 184(2), 945-949 (2007b)
8. Dannenbring, D.G.: An evaluation of flow shop sequencing heuristics. Management Science 23(11), 1174-1182 (1977)
9. Davoud Pour, H.: A new heuristic for the n-job, m-machine flow-shop problem. Production Planning & Control 12(7), 648-653 (2001)
10. Du, J., Leung, J.Y.-T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15(3), 483-495 (1990)
11. Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55(1), 1243-1255 (2004)
12. Framinan, J.M., Leisten, R.: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. OR Spectrum 30(4), 787-804 (2008)
13. Framinan, J.M., Leisten, R., 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. International Journal of Production Research 41(1), 121-148 (2003)
14. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1(2), 117-129 (1976)
15. Giaro, K.: NP-hardness of compact scheduling in simplified open and flow shops. European Journal of Operational Research 130(1), 90-98 (2001)
16. Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: Complexity and approximation. Operations Research 26(1), 36-52 (1978)
17. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287-326 (1979)
18. Hejazi, S.R., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research 43(14), 2895-2929 (2005)
19. Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1(1), 61-68 (1954)
20. Kalczynski, P.J., Kamburowski, J.: A heuristic for minimizing the makespan in no-idle permutation flow shops. Computers & Industrial Engineering 49(1), 146-154 (2005)
21. Kalczynski, P.J., Kamburowski, J.: On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research 178(3), 677-685 (2007)
22. Kamburowski, J.: More on three-machine no-idle flow shops. Computers & Industrial Engineering 46(3), 461-466 (2004)
23. Koulamas, C.: A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 105(1), 66-71 (1998)
24. Liao, C.J.: Minimizing the number of machine idle intervals with minimum makespan in a flowshop. Journal of the Operational Research Society 44(8), 817-824 (1993)
25. Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multi-objective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 20(3), 451-471 (2008)
26. Montgomery, D.: Design and Analysis of Experiments, 6th edn. John Wiley & Sons, New York (2005)
27. Narain, L., Bagga, P.C.: Minimizing total elapsed time subject to zero total idle time of machines in n × 3 flowshop problem. Indian Journal of Pure & Applied Mathematics 34(2), 219-228 (2003)
28. Narain, L., Bagga, P.C.: Flowshop/no-idle scheduling to minimise the mean flowtime. Anziam Journal 47, 265-275 (2005a)
29. Narain, L., Bagga, P.C.: Flowshop/no-idle scheduling to minimize total elapsed time. Journal of Global Optimization 33(3), 349-367 (2005b)
30. Narasimhan, S.L., Mangiameli, P.M.: A comparison of sequencing rules for a two stage hybrid flowshop. Decision Sciences 18(2), 250-265 (1987)
31. Narasimhan, S.L., Panwalkar, S.S.: Scheduling in a two stage manufacturing process. International Journal of Production Research 22(4), 555-564 (1984)
32. Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science 11(1), 91-95 (1983)
33. Niu, Q., Gu, X.S.: An improved genetic-based particle swarm optimization for no-idle permutation flow shops with fuzzy processing time. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS, vol. 4099, pp. 757-766. Springer, Heidelberg (2006)
34. Osman, I., Potts, C.: Simulated annealing for permutation flow-shop scheduling. OMEGA, The International Journal of Management Science 17(6), 551-557 (1989)
35. Page, E.S.: An approach to the scheduling of jobs on machines. Journal of the Royal Statistical Society, B Series 23(2), 484-492 (1961)
36. Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly 16(1), 101-107 (1965)
37. Pan, Q.-K., Wang, L.: No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology 39(7-8), 796-807 (2008a)
38. Pan, Q.-K., Wang, L.: A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. European Journal of Industrial Engineering 2(3), 279-297 (2008b)
39. Pan, Q.-K., Wang, L., Zhao, B.-H.: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology 38(7-8), 778-786 (2008)
40. Rad, S.F., Ruiz, R., Boroojerdian, N.: New high performing heuristics for minimizing makespan in permutation flowshops. OMEGA, the International Journal of Management Science 37(2), 331-345 (2009)
41. Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers & Operations Research 22(1), 5-13 (1995)
42. Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165(2), 479-494 (2005)
43. Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flow-shop scheduling problem. OMEGA, the International Journal of Management Science 34(5), 461-476 (2006)
44. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033-2049 (2007)
45. Ruiz, R., Stützle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research 187(3), 1143-1159 (2008)
46. Saadani, N.E.H., Baptiste, P.: Relaxation of the no-idle constraint in the flow-shop problem. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1997, Lyon, France, pp. 305-309 (2002)
47. max problem. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 2001, Quebec, Canada, vol. 2, pp. 880-888 (2001)
48. Saadani, N.E.H., Guinet, A., Moalla, M.: Three stage no-idle flow-shops. Computers & Industrial Engineering 44(3), 425-434 (2003)
49. max problem. European Journal of Operational Research 161(1), 11-20 (2005)
50. Salveson, M.E.: On a quantitative method in production planning and scheduling. Econometrica 20(4), 554-590 (1952)
51. Suliman, S.M.A.: A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 64(1-3), 143-152 (2000)
52. Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47(1), 67-74 (1990)
53. Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64(2), 278-285 (1993)
54. Tanaev, V.S., Sotskov, Y.N., Strusevich, V.A.: Scheduling Theory. Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht (1994)
55. Turner, S., Booth, D.: Comparison of heuristics for flow shop sequencing. OMEGA, The International Journal of Management Science 15(1), 75-78 (1987)
56. Vachajitpan, P.: Job sequencing with continuous machine operation. Computers & Industrial Engineering 6(3), 255-259 (1982)
57. Vallada, E., Ruiz, R.: Cooperative metaheuristics for the permutation flowshop scheduling problem. European Journal of Operational Research 193(2), 365-376 (2009)
58. Vallada, E., Ruiz, R., Minella, G.: Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research 35(4), 1350-1373 (2008)
59. Cepek, O., Okada, M., Vlach, M.: Note: On the two-machine no-idle flowshop problem. Naval Research Logistics 47(4), 353-358 (2000)
60. Wang, Z.B., Xing, W.X., Bai, F.S.: No-wait flexible flowshop scheduling with no-idle machines. Operations Research Letters 33(6), 609-614 (2005)
61. Woollam, C.R.: Flowshop with no-idle machine time allowed. Computers & Industrial Engineering 10(1), 69-76 (1986)
62. Ying, K.-C.: An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. In press at Journal of the Operational Research Society (2008)