The distributed permutation flowshop scheduling problem

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 754-768

  Naderi, B ^a   Ruiz, Rubén ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

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

Author keywords

Distributed scheduling; Mixed integer linear programming; Permutation flowshop; Variable neighborhood descent

Indexed keywords

COMPLETION TIME; DESCENT METHOD; DISPATCHING RULES; DISTRIBUTED SCHEDULING; MAKESPAN; MIXED INTEGER LINEAR PROGRAMMING; MIXED INTEGER LINEAR PROGRAMMING MODEL; OPTIMIZATION CRITERIA; PERMUTATION FLOWSHOP; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; STATISTICAL ANALYSIS; VARIABLE NEIGHBORHOOD DESCENT;

DYNAMIC PROGRAMMING; HEURISTIC METHODS; INDUSTRIAL PLANTS; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

INTEGER PROGRAMMING;

EID: 70350752447     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.06.019     Document Type: Article

References (55)

1. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 1 (1954) 61-68
2. Baker K.R. Introduction to sequencing and scheduling (1974), Wiley, New York
3. 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. Annals of Discrete Mathematics 5 (1979) 287-326
4. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 2 (1976) 117-129
5. Framinan J.M., Gupta J.N.D., and Leisten R. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55 12 (2004) 1243-1255
6. Hejazi S.R., and Saghafian S. Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research 43 14 (2005) 2895-2929
7. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 2 (2005) 479-494
8. Gupta J.N.D., and Stafford E.F. Flowshop scheduling research after five decades. European Journal of Operational Research 169 3 (2006) 699-711
9. Moon C., Kim J., and Hur S. Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain. Computers & Industrial Engineering 43 1-2 (2002) 331-349
10. Wang B. Integrated product, process and enterprise design. 1st ed. (1997), Chapman & Hall, London
11. Kahn K.B., Castellion G.A., and Griffin A. The PDMA handbook of new product development. 2nd ed. (2004), Wiley, New York
12. Hansen P., and Mladenovic N. Variable neighborhood search: principles and applications. European Journal of Operational Research 130 3 (2001) 449-467
13. 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 (1965) 101-107
14. Campbell H.G., Dudek R.A., and Smith M.L. Heuristic algorithm for N-job, M-machine sequencing problem. Management Science Series B-Application 16 10 (1970) B630-B637
15. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science 11 1 (1983) 91-95
16. 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. International Journal of Production Research 41 1 (2003) 121-148
17. Dong X.Y., Huang H.K., and Chen P. An improved NEH-based heuristic for the permutation flowshop problem. Computers & Operations Research 35 12 (2008) 3962-3968
18. Rad S.F., Ruiz R., and Boroojerdian N. New high performing heuristics for minimizing makespan in permutation flowshops. Omega-International Journal of Management Science 37 2 (2009) 331-345
19. Kalczynski P.J., and Kamburowski J. An empirical analysis of the optimality rate of flow shop heuristics. European Journal of Operational Research 198 1 (2009) 93-101
20. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91 1 (1996) 160-175
21. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31 11 (2004) 1891-1909
22. Osman I.H., and Potts C.N. Simulated annealing for permutation flowshop scheduling. Omega-International Journal of Management Science 17 6 (1989) 551-557
23. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers & Operations Research 22 1 (1995) 5-13
24. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega-International Journal of Management Science 34 5 (2006) 461-476
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 2 (2004) 426-438
26. Onwubolu G.C., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 2 (2006) 674-692
27. Tasgetiren M.F., Liang Y.C., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 3 (2007) 1930-1947
28. 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 3 (2007) 2033-2049
29. Vallada E., and Ruiz R. Cooperative metaheuristics for the permutation flowshop scheduling problem. European Journal of Operational Research 193 2 (2009) 365-376
30. 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 4 (2008) 1350-1373
31. Minella G., Ruiz R., and Ciavotta M. A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing 20 3 (2008) 451-471
32. Jia H.Z., Fuh J.Y.H., Nee A.Y.C., and Zhang Y.F. Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurrent Engineering-Research and Applications 10 1 (2002) 27-39
33. Jia H.Z., Nee A.Y.C., Fuh J.Y.H., and Zhang Y.F. A modified genetic algorithm for distributed scheduling problems. Journal of Intelligent Manufacturing 14 3-4 (2003) 351-362
34. Jia H.Z., Fuh J.Y.H., Nee A.Y.C., and Zhang Y.F. Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Computers & Industrial Engineering 53 2 (2007) 313-320
35. Chan F.T.S., Chung S.H., and Chan P.L.Y. An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Systems with Applications 29 2 (2005) 364-371
36. Chan F.T.S., Chung S.H., Chan L.Y., Finke G., and Tiwari M.K. Solving distributed FMS scheduling problems subject to maintenance: genetic algorithms approach. Robotics and Computer-Integrated Manufacturing 22 5-6 (2006) 493-504
37. Wang L., and Shen W. Process planning and scheduling for distributed manufacturing (2007), Springer, London
38. Wagner H.M. An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly 6 2 (1959) 131-140
39. Manne A.S. On the job-shop scheduling problem. Operations Research 8 2 (1960) 219-223
40. Stafford E.F. On the development of a mixed-integer linear-programming model for the flowshop sequencing problem. Journal of the Operational Research Society 39 12 (1988) 1163-1174
41. Wilson J.M. Alternative formulations of a flowshop scheduling problem. Journal of the Operational Research Society 40 4 (1989) 395-399
42. Pan C.H. A study of integer programming formulations for scheduling problems. International Journal of Systems Science 28 1 (1997) 33-41
43. Tseng F.T., Stafford E.F., and Gupta J.N.D. An empirical analysis of integer programming formulations for the permutation flowshop. Omega-International Journal of Management Science 32 4 (2004) 285-293
44. Stafford E.F., Tseng F.T., and Gupta J.N.D. Comparative evaluation of MILP flowshop models. Journal of the Operational Research Society 56 1 (2005) 88-101
45. Tseng F.T., and Stafford E.F. New MILP models for the permutation flowshop problem. Journal of the Operational Research Society 59 10 (2008) 1373-1386
46. Taillard E. Some efficient heuristic methods for the flow-shop sequencing problem. European Journal of Operational Research 47 1 (1990) 65-74
47. Mladenovic N., and Hansen P. Variable neighborhood search. Computers & Operations Research 24 11 (1997) 1097-1100
48. Stützle T. Applying iterated local search to the permutation flow shop problem. AIDA-98-04, FG Intellektik, TU Darmstadt; 1998.
49. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 2 (1993) 278-285
50. Morgan J.N., and Sonquist J.A. Problems in analysis of survey data, and a proposal. Journal of the American Statistical Association 58 302 (1963) 415-434
51. Biggs D., De Ville B., and Suen E. A method of choosing multiway partitions for classification and decision trees. Journal of Applied Statistics 18 1 (1991) 49-62
52. Ruiz R., Serifoglu F.S., and Urlings T. Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research 35 4 (2008) 1151-1175
53. Pan Q.K., and Wang L. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. European Journal of Industrial Engineering 2 3 (2008) 279-297
54. Pessan C., Bouquard J.-L., and Néron E. An unrelated parallel machines model for an industrial production resetting problem. European Journal of Industrial Engineering 2 2 (2008) 153-171
55. Hmida A.B., Huguet M.J., Lopez P., and Haouari M. Climbing depth-bounded discrepancy search for solving hybrid flow shop problems. European Journal of Industrial Engineering 1 2 (2007) 223-240