메뉴 건너뛰기




Volumn 21, Issue 1, 2014, Pages 103-126

Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues

Author keywords

Biased randomized heuristics; Flow shop problem; Iterated local search; Metaheuristics; Parallelizable algorithms; Parameters setting; Scheduling

Indexed keywords

FLOW SHOP PROBLEMS; ITERATED LOCAL SEARCH; META HEURISTICS; PARAMETERS SETTING; RANDOMIZED HEURISTICS;

EID: 84889683989     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12028     Document Type: Article
Times cited : (66)

References (52)
  • 1
    • 79952442619 scopus 로고    scopus 로고
    • A self-adaptive local search algorithm for the classical vehicle routing problem
    • Alabas-Uslu, C., Dengiz, B., 2011. A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Systems and Applications 38, 8990-8998.
    • (2011) Expert Systems and Applications , vol.38 , pp. 8990-8998
    • Alabas-Uslu, C.1    Dengiz, B.2
  • 2
    • 0037410971 scopus 로고    scopus 로고
    • New heuristics for no-wait flowshops to minimize makespan
    • Aldowaisan, T., Allahvedi, A., 2003. New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 30, 8, 1219-1231.
    • (2003) Computers and Operations Research , vol.30 , Issue.8 , pp. 1219-1231
    • Aldowaisan, T.1    Allahvedi, A.2
  • 4
    • 0014807274 scopus 로고
    • A heuristic algorithm for the n job, m machine sequencing problem
    • Campbell, H.G., Dudek, R.A., Smith, M.L., 1970. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16, B630-B637.
    • (1970) Management Science , vol.16
    • Campbell, H.G.1    Dudek, R.A.2    Smith, M.L.3
  • 5
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • Chandrasekharan, R., Ziegler, H., 2004. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 2, 426-438.
    • (2004) European Journal of Operational Research , vol.155 , Issue.2 , pp. 426-438
    • Chandrasekharan, R.1    Ziegler, H.2
  • 8
    • 79956078202 scopus 로고    scopus 로고
    • MO-TRIBES: an adaptive multiobjective particle swarm optimization algorithm
    • Cooren, Y., Clerc, M., Siarry, P., 2011. MO-TRIBES: an adaptive multiobjective particle swarm optimization algorithm. Computational Optimization and Applications 49, 2, 379-400.
    • (2011) Computational Optimization and Applications , vol.49 , Issue.2 , pp. 379-400
    • Cooren, Y.1    Clerc, M.2    Siarry, P.3
  • 10
    • 0017516618 scopus 로고
    • An evaluation of flowshop sequence heuristics
    • Dannenbring, D.G., 1977. An evaluation of flowshop sequence heuristics. Management Science 23, 1174-1182.
    • (1977) Management Science , vol.23 , pp. 1174-1182
    • Dannenbring, D.G.1
  • 11
    • 79951858052 scopus 로고    scopus 로고
    • An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
    • Engin, O., Ceran, G., Yilmaz, M.K., 2011. An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Applied Soft Computing 11, 3056-3065.
    • (2011) Applied Soft Computing , vol.11 , pp. 3056-3065
    • Engin, O.1    Ceran, G.2    Yilmaz, M.K.3
  • 15
    • 9744246863 scopus 로고    scopus 로고
    • A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
    • Framinan, J.M., Gupta, J.N.D., Leisten, R., 2004. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55, 1243-1255.
    • (2004) Journal of the Operational Research Society , vol.55 , pp. 1243-1255
    • Framinan, J.M.1    Gupta, J.N.D.2    Leisten, R.3
  • 16
    • 0037971131 scopus 로고    scopus 로고
    • An efficient constructive heuristic for flowtime minimisation in permutation flow shops
    • Framinan, J.M., Leisten, R., 2003. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 31, 311-317.
    • (2003) OMEGA , vol.31 , pp. 311-317
    • Framinan, J.M.1    Leisten, R.2
  • 17
    • 28244470744 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization
    • Gendreau, M., Potvin, J.Y., 2005. Metaheuristics in combinatorial optimization. Annals of Operations Research 140, 1, 189-213.
    • (2005) Annals of Operations Research , vol.140 , Issue.1 , pp. 189-213
    • Gendreau, M.1    Potvin, J.Y.2
  • 19
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • Johnson, S.M., 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61-68.
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 20
    • 84880506516 scopus 로고    scopus 로고
    • Using parallel & distributed computing for solving real-time vehicle routing problems with stochastic demands
    • doi:10.1007/s10479-011-0918-z.
    • Juan, A., Faulin, J., Jorba, J., Caceres, J., Marques, J., 2011a. Using parallel & distributed computing for solving real-time vehicle routing problems with stochastic demands. Annals of Operations Research, 1-22, doi:10.1007/s10479-011-0918-z.
    • (2011) Annals of Operations Research , pp. 1-22
    • Juan, A.1    Faulin, J.2    Jorba, J.3    Caceres, J.4    Marques, J.5
  • 21
    • 79954489685 scopus 로고    scopus 로고
    • On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics
    • Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B., 2011b. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. Journal of the Operational Research Society 62, 1085-1097.
    • (2011) Journal of the Operational Research Society , vol.62 , pp. 1085-1097
    • Juan, A.1    Faulin, J.2    Jorba, J.3    Riera, D.4    Masip, D.5    Barrios, B.6
  • 22
    • 70350095576 scopus 로고    scopus 로고
    • The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
    • Juan, A., Faulin, J., Ruiz, R., Barrios, B., Caballe, S., 2010. The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Applied Soft Computing 10, 1, 215-224.
    • (2010) Applied Soft Computing , vol.10 , Issue.1 , pp. 215-224
    • Juan, A.1    Faulin, J.2    Ruiz, R.3    Barrios, B.4    Caballe, S.5
  • 23
    • 78049318410 scopus 로고    scopus 로고
    • Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach
    • Kahraman, C., Engin, O., Kaya, I., Ozturk, R.E., 2010. Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach. Applied Soft Computing 10, 1293-1300.
    • (2010) Applied Soft Computing , vol.10 , pp. 1293-1300
    • Kahraman, C.1    Engin, O.2    Kaya, I.3    Ozturk, R.E.4
  • 24
    • 9644279631 scopus 로고    scopus 로고
    • A computational study of the permutation flow shop problem based on a tight lower bound
    • Ladhari, T., Haouari, M., 2005. A computational study of the permutation flow shop problem based on a tight lower bound. Computers & Operations Research 32, 1831-1847.
    • (2005) Computers & Operations Research , vol.32 , pp. 1831-1847
    • Ladhari, T.1    Haouari, M.2
  • 25
    • 0035691159 scopus 로고    scopus 로고
    • Software for uniform random number generation: distinguishing the good and the bad
    • IEEE Press, Arlington, VA.
    • L'Ecuyer, P., 2001. Software for uniform random number generation: distinguishing the good and the bad. Proceedings of the 2001 Winter Simulation Conference, IEEE Press, Arlington, VA, pp. 95-105.
    • (2001) Proceedings of the 2001 Winter Simulation Conference , pp. 95-105
    • L'Ecuyer, P.1
  • 26
    • 80555126361 scopus 로고    scopus 로고
    • Iterated local search: framework and applications
    • In Gendreau, M. and Potvin, J.Y. (eds), Vol., International Series in Operations Research & Management Science. Kluwer Academic Publishers, Dordrecht.
    • Lourenço, H.R., Martin, O., Stützle, T., 2010. Iterated local search: framework and applications. In Gendreau, M. and Potvin, J.Y. (eds) Handbook of Metaheuristics, Vol. 146, International Series in Operations Research & Management Science. Kluwer Academic Publishers, Dordrecht, pp. 363-397.
    • (2010) Handbook of Metaheuristics , vol.146 , pp. 363-397
    • Lourenço, H.R.1    Martin, O.2    Stützle, T.3
  • 28
    • 79955339651 scopus 로고    scopus 로고
    • An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem
    • IEEE Press, Singapore.
    • Matsui, S., Yamada, S., 2007. An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, IEEE Press, Singapore, pp. 3796-3803.
    • (2007) Proceedings of the 2007 IEEE Congress on Evolutionary Computation , pp. 3796-3803
    • Matsui, S.1    Yamada, S.2
  • 29
    • 0029342362 scopus 로고
    • A new heuristic method for the permutation flow-shop scheduling problem
    • Moccellin, J.V., 1995. A new heuristic method for the permutation flow-shop scheduling problem. Journal of the Operational Research Society 46, 883-886.
    • (1995) Journal of the Operational Research Society , vol.46 , pp. 883-886
    • Moccellin, J.V.1
  • 30
    • 44649108891 scopus 로고    scopus 로고
    • A constructive genetic algorithm for permutation flowshop scheduling
    • Nagano, M.S., Ruiz, R., Nogueira, L.A., 2008. A constructive genetic algorithm for permutation flowshop scheduling. Computers & Industrial Engineering 55, 195-207.
    • (2008) Computers & Industrial Engineering , vol.55 , pp. 195-207
    • Nagano, M.S.1    Ruiz, R.2    Nogueira, L.A.3
  • 31
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flowshop sequencing problem
    • Nawaz, M., Enscore, E., Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11, 91-95.
    • (1983) OMEGA , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.2    Ham, I.3
  • 32
    • 38249025037 scopus 로고
    • Simulated annealing for permutation flow-shop scheduling
    • Osman, L., Potts, C., 1989. Simulated annealing for permutation flow-shop scheduling. OMEGA 17, 6, 551-557.
    • (1989) OMEGA , vol.17 , Issue.6 , pp. 551-557
    • Osman, L.1    Potts, C.2
  • 33
    • 49649122428 scopus 로고    scopus 로고
    • An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    • Pan, Q.K., Wang, L., Zhao, B.H., 2008. 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) International Journal of Advanced Manufacturing Technology , vol.38 , Issue.7-8 , pp. 778-786
    • Pan, Q.K.1    Wang, L.2    Zhao, B.H.3
  • 34
    • 0013132075 scopus 로고    scopus 로고
    • Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment
    • Prais, M., Ribeiro, C.C., 2000. Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12, 164-176.
    • (2000) INFORMS Journal on Computing , vol.12 , pp. 164-176
    • Prais, M.1    Ribeiro, C.C.2
  • 37
    • 0027578685 scopus 로고
    • Improving the efficiency of tabu search for machine scheduling problems
    • Reeves, C.R., 1993. Improving the efficiency of tabu search for machine scheduling problems. Journal of the Operational Research Society 44, 4, 375-382.
    • (1993) Journal of the Operational Research Society , vol.44 , Issue.4 , pp. 375-382
    • Reeves, C.R.1
  • 38
    • 0029224965 scopus 로고
    • A genetic algorithm for flowshop sequencing
    • Reeves, C.R., 1995. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 1, 5-13.
    • (1995) Computers and Operations Research , vol.22 , Issue.1 , pp. 5-13
    • Reeves, C.R.1
  • 39
    • 84889672574 scopus 로고    scopus 로고
    • GRASP: greedy randomized adaptive search procedures
    • In Burke, E.K. and Kendall, G. (eds), 2nd edn. Springer, New York.
    • Resende, M.G.C., Ribeiro, C.C., 2005. GRASP: greedy randomized adaptive search procedures. In Burke, E.K. and Kendall, G. (eds) Search Methodologies, 2nd edn. Springer, New York.
    • (2005) Search Methodologies
    • Resende, M.G.C.1    Ribeiro, C.C.2
  • 40
    • 77955274194 scopus 로고    scopus 로고
    • Comparing three-step heuristics for the permutation flow shop problem
    • 37-12
    • Ribas, I., Companys, R., Tort-Martorell, X., 2010. Comparing three-step heuristics for the permutation flow shop problem. Computers & Operations Research 37-12, 2062-2070.
    • (2010) Computers & Operations Research , pp. 2062-2070
    • Ribas, I.1    Companys, R.2    Tort-Martorell, X.3
  • 41
    • 0031380980 scopus 로고    scopus 로고
    • Simulation model verification and validation: increasing the user's confidence
    • IEEE Computer Society, Atlanta, GA.
    • Robinson, S., 1997. Simulation model verification and validation: increasing the user's confidence. Proceedings of the 1997 Winter Simulation Conference, IEEE Computer Society, Atlanta, GA, pp. 53-59.
    • (1997) Proceedings of the 1997 Winter Simulation Conference , pp. 53-59
    • Robinson, S.1
  • 42
    • 13444251134 scopus 로고    scopus 로고
    • A comprehensive review and evaluation of permutation flowshop heuristics
    • Ruiz, R., Maroto, C., 2005. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165, 479-494.
    • (2005) European Journal of Operational Research , vol.165 , pp. 479-494
    • Ruiz, R.1    Maroto, C.2
  • 44
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flow-shop scheduling problem
    • Ruiz, R., Stützle, T, 2007. A simple and effective iterated greedy algorithm for the permutation flow-shop scheduling problem. European Journal of Operational Research 177, 2033-2049.
    • (2007) European Journal of Operational Research , vol.177 , pp. 2033-2049
    • Ruiz, R.1    Stützle, T.2
  • 45
    • 12344333130 scopus 로고    scopus 로고
    • Applying Iterated Local Search to the Permutation Flow Shop Problem
    • (accessed June 10, 2013).
    • Stützle, T., 1998. Applying Iterated Local Search to the Permutation Flow Shop Problem. Available at http://iridia.ulb.ac.be/~stuetzle/publications/AIDA-98-04.pdf (accessed June 10, 2013).
    • (1998)
    • Stützle, T.1
  • 46
    • 0033908223 scopus 로고    scopus 로고
    • A two-phase heuristic approach to the permutation flow-shop scheduling problem
    • Suliman, S., 2000. A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 65, 1-3, 143-152.
    • (2000) International Journal of Production Economics , vol.65 , Issue.1-3 , pp. 143-152
    • Suliman, S.1
  • 47
    • 0025700701 scopus 로고
    • Some efficient heuristic methods for the flow shop sequencing problem
    • Taillard, E., 1990. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65-74.
    • (1990) European Journal of Operational Research , vol.47 , pp. 65-74
    • Taillard, E.1
  • 50
    • 0024700013 scopus 로고
    • A new heuristic method for the flow shop sequencing problem
    • Widmer, M., Hertz, A., 1989. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41, 2, 186-193.
    • (1989) European Journal of Operational Research , vol.41 , Issue.2 , pp. 186-193
    • Widmer, M.1    Hertz, A.2
  • 52
    • 54449086192 scopus 로고    scopus 로고
    • Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
    • Zobolas, C., Tarantilis, C., Ioannou, G., 2009. Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research 36, 1249-1267.
    • (2009) Computers & Operations Research , vol.36 , pp. 1249-1267
    • Zobolas, C.1    Tarantilis, C.2    Ioannou, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.