Cooperative metaheuristics for the permutation flowshop scheduling problem

European Journal of Operational Research

Volumn 193, Issue 2, 2009, Pages 365-376

  Vallada, Eva ^a   Ruiz, Rubén ^a  

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

Author keywords

Cooperative metaheuristics; Makespan; Permutation flowshop; Scheduling; Total tardiness

Indexed keywords

KETONES; LANDFORMS; LEARNING SYSTEMS; SCHEDULING; STATISTICAL METHODS;

COOPERATIVE METAHEURISTICS; ISLAND MODELS; MAKESPAN; META-HEURISTIC METHODS; META-HEURISTICS; PERMUTATION FLOWSHOP; PERMUTATION FLOWSHOP SCHEDULING PROBLEM; RUNNING-IN; SEQUENTIAL ALGORITHMS; SEQUENTIAL COUNTERPARTS; STATE-OF-THE-ART METHODS; TOTAL TARDINESS;

HEURISTIC PROGRAMMING;

EID: 53049097607     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.11.049     Document Type: Article

References (37)

1. Alba E. Parallel Metaheuristics. A New Class of Algorithms (2005), Wiley
2. Armentano V., and Ronconi D. Tabu search for total tardiness minimization in flow-shop scheduling problems. Computers & Operations Research 26 (1999) 219-235
3. Bozejko, W., Wodecki, M., 2002. Solving the flow shop problem by tabu search. In: Proceedings of the International Conference on Parallel Computing in Electrical Engineering, pp. 1730-1737.
4. Bozejko, W., Wodecki, M., 2003. Parallel genetic algorithm for the flow shop scheduling problem. In: Parallel Processing and Applied Mathematics, LNCS, vol. 3019, pp. 566-571.
5. Bozejko, W., Wodecki, M., 2004. Parallel genetic algorithm for minimizing total weighted completion time. In: Artificial Intelligence and Soft Computing, Lecture Notes in Artificial Intelligence, vol. 3070, pp. 400-405.
6. Bozejko, W., Wodecki, M., 2006. A new inter-island genetic operator for optimization problems with block properties. In: Artificial Intelligence and Soft Computing, Lecture Notes in Artificial Intelligence, vol. 4029, pp. 334-343.
7. Farahmand Rad, S., Ruiz, R., Boroojerdian, N., in press. New high performing heuristics for minimizing makespan in permutation flowshops. OMEGA, The International Journal of Management Science.
8. Flynn M. Some computer organizations and their effectiveness. IEEE Transactions on Computing 9 21 (1972) 948-960
9. Gelders L., and Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research 16 3 (1978) 221-231
10. Gill S. Parallel programming. The Computer Journal 1 (1958) 2-10
11. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation glow shop problem with makespan criterion. Computers & Operations Research 31 (2004) 1891-1909
12. Gupta J.N.D., and Stafford Jr. E.F. Flowshop scheduling research after five decades. European Journal of Operational Research 169 (2006) 699-711
13. Hasija S., and Rajendran C. Scheduling in flowshops to minimize total tardiness of jobs. International Journal of Production Research 42 11 (2004) 2289-2301
14. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
15. Kim Y. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of Operational Research Society 44 1 (1993) 19-28
16. Kim Y., Lim H., and Park M. Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process. European Journal of Operational Research 91 (1996) 124-143
17. Ladhari T., and Haouari M. A computational study of the permutation flow shop problem based on a tight lower bound. Computers & Operations Research 32 (2005) 1831-1847
18. Melab N., Mezmaz M., and Talbi E. Parallel cooperative meta-heuristics on the computational grid. a case study: The bi-objective flow-shop problem. Parallel Computing 32 (2006) 643-659
19. Montgomery D. Design and Analysis of Experiments. sixth ed. (2005), John Wiley & Sons, New York
20. Nawaz M., Enscore Jr. E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science 11 1 (1983) 91-95
21. Onwubolu G., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 (2006) 674-692
22. Oǧuz, C., Fung, Y., Fikret Ercan, M., Qi, X., 2003. Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks. In: Proceedings of the International Conference on Computational Science. Springer, pp. 548-559.
23. Ow P. Focused scheduling in proportionate flowshops. Management Science 31 7 (1985) 852-869
24. Pinedo M. Scheduling: Theory Algorithms and Systems. second ed. (2002), Prentice Hall, New Jersey
25. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 (2004) 426-438
26. Raman N. Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches. Journal of Operations Management 85 (1995) 131-151
27. Ruiz R., and Allahverdi A. No-wait flowshop with separate setup times to minimize maximum lateness. International Journal of Advanced Manufacturing Technology 35 (2007) 551-565
28. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 (2005) 479-494
29. Ruiz R., and Stützle T. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177 (2007) 2033-2049
30. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA, The International Journal of Management Science 34 (2006) 461-476
31. max flowshop problem. New Directions for Operations Research in Manufacturing, pp. 161-175.
32. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
33. Tseng F.T., Stafford Jr. E.F., and Gupta J.N.D. An empirical analysis of integer programming formulations for the permutation flowshop. OMEGA, The International Journal of Management Science 32 4 (2004) 285-293
34. Vallada, E., Ruiz, R., submitted for publication. New genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Technical Report, http://www.upv.es/deioac/Investigacion/technical_reports.htm.
35. Vallada E., Ruiz R., and Minella G. Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research 35 (2008) 1350-1373
36. Vignier, A., Venturini, G., 1996. Resolution of a hybrid flowshop with a parallel genetic algorithm. In: Proceedings of the Fifth International Workshop on Project Management and Scheduling, pp. 258-261.
37. Wodecki, M., Bozejko, W., 2002. Solving the flow shop problem by parallel simulated annealing. In: Parallel Processing and Applied Mathematics, LNCS, vol. 2328, pp. 236-244.