Hybrid flowshop scheduling with machine and resource-dependent processing times

Applied Mathematical Modelling

Volumn 35, Issue 3, 2011, Pages 1107-1123

  Behnamian, J ^a   Fatemi Ghomi, S M T ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Hybrid flowshop scheduling; Hybrid metaheuristic; Machines with different speeds; Multi objective optimization; Resource allocation; Sequence dependent setup times

Indexed keywords

DECISION MAKERS; DIFFERENT SPEED; DIFFERENT STRUCTURE; DISTANCE PARAMETER; HYBRID APPROACH; HYBRID FLOW SHOP SCHEDULING; MAKESPAN; METAHEURISTIC; MIN-MAX; MULTI OBJECTIVE; MULTIPLE OBJECTIVE DECISION-MAKING; NEW SOLUTIONS; PARETO OPTIMAL SOLUTIONS; PROCESSING TIME; PRODUCTION SCHEDULING; REAL WORLD SITUATIONS; RESOURCE-DEPENDENT PROCESSING TIME; SEQUENCE-DEPENDENT SETUP TIME; TWO-COMPONENT; VARIABLE NEIGHBORHOOD SEARCH;

COMPUTER RESOURCE MANAGEMENT; DECISION MAKING; HEURISTIC METHODS; PRODUCTION ENGINEERING; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 78549269075     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2010.07.057     Document Type: Article

References (57)

1. Linn R., Zhang W. Hybrid flow shop scheduling: a survey. Comput. Ind. Eng. 1999, 37(1):57-61.
2. Low C., Hsu C.-J., Su C.-T. A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines. Comput. Oper. Res. 2008, 35(3):845-853.
3. Tavakkoli-Moghaddam R., Rahimi-Vahed A., Hossein Mirzaei A. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inform. Sci. 2007, 177:5072-5090.
4. Fandel G., Spronk J. Multiple Criteria Decision Methods and Applications 1985, Springer Verlag, Berlin.
5. Hwang C.-L., Masud A.S.M. Multiple Objectives Decision Making - Methods and Applications 1979, Springer, Berlin.
6. Jungwattanakit J., Reodecha M., Chaovalitwongse P., Werner F.A. comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Comput. Oper. Res. 2009, 36:358-378.
7. Lin J.G. On min-norm and min-max methods of multi-objective optimization. Math. Program. 2005, 103:11-33.
8. Zhou C., Egbelu P.J. Scheduling in a manufacturing shop with sequence-dependent setups. Robot. Comput.-Int. Manuf. 1989, 5(1):73-81.
9. Su L-H., Lien C-Y. Scheduling parallel machines with resource-dependent processing times. Int. J. Prod. Econ. 2009, 117(2):256-266.
10. Schaffer J.D. Multiple objective optimization with vector evaluated genetic algorithms. Proceedings of First International Conference on Genetic Algorithms and Their Applications 1985, 93-100. Carnegie-Mellon University, Pittsburgh, PA, USA, July.
11. Murata T., Ishibuchi H., Tanaka H. Multi-objective genetic algorithm and its application to flowshop scheduling. Comput. Ind. Eng. 1996, 30:957-968.
12. K. Deb, S.A. Amrit Pratap, T. Meyarivan, A fast and elitist multi objective genetic algorithm-NSGA-II, in: Proceedings of the Parallel Problem Solving From Nature VI Conference, Paris, France, September 2000, pp. 849-858.
13. Zitzler E., Laumanns M., Bleuler S. A tutorial on evolutionary multiobjective optimization. Proceedings of the Workshop on Multiple Objective Metaheuristics (MOMH 2002) 2004, 3-38. Springer-Verlag, Paris, France, July.
14. Affenzeller M. New generic hybrids based upon genetic algorithms. Lect. Notes Comput. Sci. 2002, 2527:329-339.
15. Cochran J.K., Horng S.M., Fowler J.W. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput. Oper. Res. 2003, 30:1087-1102.
16. Hu J., Goodman E., Seo K., Fan Z., Rosenberg R. The hierarchical fair competition framework for sustainable evolutionary algorithms. Evol. Comput. 2005, 13(2):241-277.
17. Mostaghim S., Teich J. Covering Pareto-optimal fronts by subswarms in multiobjective particle swarm optimization. Evol. Comput. 2004, 2:1404-1411.
18. Chang P.-C., Chen S-H., Lin K.-L. Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Syst. Appl. 2005, 29(3):705-712.
19. Chang P.-C., Chen S-H., Hsieh J-Ch. A global archive sub-population genetic algorithm with adaptive strategy in multi-objective parallel-machine scheduling problem. Lect. Notes Comput. Sci. 2006, 4221:730-739.
20. Lee I., Sikora R., Shaw M.J. A genetic algorithm based approach to flexible flow-line scheduling with variable lot sizes. IEEE Trans. Syst. Man Cyb. Part B 1997, 27(1):36-54.
21. Rios-Mercado R.Z., Bard J.F. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput. Oper. Res. 1998, 25(5):351-366.
22. Botta-Genoulaz V. Hybrid flowshop scheduling with precedence constraints and time lags to minimize maximum lateness. Int. J. Prod. Econ. 2000, 64(1-3):101-111.
23. Azizoglu M., Cakmak E., Kondakci S. A flexible flow shop problem with total flow time minimization. Eur. J. Oper. Res. 2001, 132:528-538.
24. Gupta J.N.D., Kruger K., Lauff V., Werner F., Sotskov Y.N. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput. Oper. Res. 2002, 29:1417-1439.
25. Harjunkoski I., Grossmann I.E. Decomposition techniques for multistage scheduling problems using mixed integer and constraint programming methods. Comput. Chem. Eng. 2002, 26(11):1533-1552.
26. Kurz M.E., Askin R.G. Comparing scheduling rules for flexible flow lines. Int. J. Prod. Econ. 2003, 85:371-388.
27. Wardono B., Fathi Y. A tabu search algorithm for the multi-stage parallel machine problems with limited buffer capacities. Eur. J. Oper. Res. 2004, 155:380-401.
28. Andrés C., Albarraci{dotless}́n J.M., Tormo G., Vicens E., Garci{dotless}́a-Sabater J.P. Group technology in a hybrid flowshop environment: a case study. Eur. J. Oper. Res. 2005, 167:272-281.
29. Tang L.X., Xuan H., Liu J. A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Comput. Oper. Res. 2006, 33:3344-3359.
30. Zandieh M., Fatemi Ghomi S.M.T., Moattar Husseini S.M. An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times. Appl. Math. Comput. 2006, 180:111-127.
31. Jina Z., Yang Z., Ito T. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem. Int. J. Prod. Econ. 2006, 100(2):322-334.
32. Johnson D.S., Aragon C.R., Mcgeoch L.A., Schevon C. Optimization by simulated annealing: an experimental evaluation. Part I: graph partitioning. Oper. Res. 1989, 37(6):865-892.
33. Janiak A., Kozan E., Lichtenstein M., Oguz C. Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion. Int. J. Prod. Econ. 2007, 105:407-424.
34. Alaykiran K., Engin O., Döyen A. Using ant colony optimization to solve hybrid flowshop scheduling problems. Int. J. Adv. Manuf. Technol. 2007, 35(5-6):541-550.
35. Choi B-C., Yoon S-H., Chung S-J. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. Eur. J. Oper. Res. 2007, 176:964-974.
36. Ying K-C. An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J. Oper. Res. Soc. 2009, 60(6):810-817.
37. Kim Y.-D., Joo B-J., Shin J-H. Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J. Heuristics 2009, 15(1):19-42.
38. Gholami M., Zandieh M., Alem-Tabriz A. Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int. J. Adv. Manuf. Technol. 2009, 42(1-2):189-201.
39. Wang X., Tang L. A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. Comput. Oper. Res. 2009, 36:907-918.
40. Naderi B., Zandieh M., Khaleghi Ghoshe Balagh A., Roshanaei V. An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst. Appl. 2009, 36:9625-9633.
41. Setämaa-Kärkkäinen A., Miettinen K., Vuori J. Heuristic for a new multiobjective scheduling problem. Optim. Lett. 2007, 1:213-225.
42. Luo H., Huang G.Q., Zhang Y., Dai Q., Chen X. Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm. Robot. Comput.-Int. Manuf. 2009, 25(6):962-971.
43. Behnamian J., Fatemi Ghomi S.M.T., Zandieh M. A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst. Appl. 2009, 36(8):11057-11069.
44. Khalouli S., Ghedjati F., Hamzaoui A. A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop. Eng. Appl. Artif. Intel. 2010, 23(5):765-771.
45. C. Kahraman, O. Engin, Í. Kay, R.E. Öztürk, Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach, Appl. Soft Comput., in press, doi:10.1016/j.asoc.2010.03.008.
46. Miettinen K. Nonlinear Multiobjective Optimization 1999, Kluwer Academic Publishers, Boston.
47. Hwang C., Paidy S., Yoon K. Mathematical programming with multiple objectives: a tutorial. Comput. Oper. Res. 1980, 7(1):5-31.
48. Osyczka A. Multicriterion Optimization in Engineering with FORTRAN Programs 1984, Wiley, New York.
49. Steuer R. Multiple Criteria Optimization: Theory, Computation and Application 1986, Wily, New York.
50. J. Andersson, A survey of multiobjective optimization in engineering design, Technical Report LiTH-IKP-R-1097, Department of Mechanical Engineering, Linköping University, Linköping, Sweden, 2000.
51. Carlos A., Coello C., Christiansen A.D. An approach to multiobjective optimization using genetic algorithms. Fuzzy Logic Evol. Program. 1995, 5:411-416.
52. Holland J. Adaptation in Natural and Artificial Systems 1975, University of Michigan Press, USA, Ann Arbor.
53. Low C., Yuling Y. Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robot. Comput.-Int. Manuf. 2009, 2(25):314-322.
54. Lin S-W., Ying K-C., Lee Z-J. Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times. Comput. Oper. Res. 2009, 36(4):1110-1121.
55. Michalewicz Z. Genetic Algorithms+Data Structure=Evolution Program 1996, Springer-Verlag, Berlin. third ed.
56. Rocha M., Gómez Ravetti M., Mateus G.R., Pardalos P.M. Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search. IMA J. Manage. Math. 2007, 18:101-115.
57. Leon V.J., Ramamoorthy B. An adaptable problem-space based search method for flexible flow line scheduling. IIE Trans. 1997, 29:115-125.