메뉴 건너뛰기




Volumn 4, Issue 4, 2012, Pages 200-205

An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems

Author keywords

Flow shop; Heuristics; IHCS; Improved hybrid Cuckoo Search; Makespan; Metaheuristics; Non deterministic polynomial time hard; NP hard; Scheduling

Indexed keywords

HEURISTIC ALGORITHMS; MACHINE SHOP PRACTICE; NP-HARD; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

EID: 84864276033     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2012.048061     Document Type: Article
Times cited : (71)

References (27)
  • 2
    • 0014807274 scopus 로고
    • A heuristic algorithm for the n job m machine sequencing problem
    • Campbell, H., Dudek, R. and Smith, M. (1970) 'A heuristic algorithm for the n job m machine sequencing problem', Management Science, Vol. 16, No. 10, pp. 630-637
    • (1970) Management Science , vol.16 , Issue.10 , pp. 630-637
    • Campbell, H.1    Dudek, R.2    Smith, M.3
  • 3
    • 0017516618 scopus 로고
    • An evaluation of flow shop sequencing heuristics
    • Dannenbring, D. (1977) 'An evaluation of flow shop sequencing heuristics', Management Science, Vol. 23, No. 11, pp. 1174-1182.
    • (1977) Management Science , vol.23 , Issue.11 , pp. 1174-1182
    • Dannenbring, D.1
  • 4
    • 0000418020 scopus 로고    scopus 로고
    • Benchmarks for shop scheduling problems
    • PII S0377221797000192
    • Demirkol, E., Mehta, S. and Uzsoy, R. (1998) 'Benchmarks for shop scheduling problems', European Journal of Operational Research, Vol. 109, No. 1, pp. 137-141. (Pubitemid 128393234)
    • (1998) European Journal of Operational Research , vol.109 , Issue.1 , pp. 137-141
    • Demirkol, E.1    Mehta, S.2    Uzsoy, R.3
  • 5
    • 84555171796 scopus 로고    scopus 로고
    • Energy efficient computation of data fusion in wireless sensor networks using cuckoo based particle approach (CBPA)
    • Divya, M., Sundarambal, M. and Anand, L.N. (2011) 'Energy efficient computation of data fusion in wireless sensor networks using cuckoo based particle approach (CBPA)', International Journal of Communications, Network and System Sciences, Vol. 4, No. 4, pp. 249-255.
    • (2011) International Journal of Communications, Network and System Sciences , vol.4 , Issue.4 , pp. 249-255
    • Divya, M.1    Sundarambal, M.2    Anand, L.N.3
  • 7
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • Johnson, S. (1954) 'Optimal two- and three-stage production schedules with setup times included', Naval Research Logistics Quarterly, Vol. 1, No. 1, pp. 61-68.
    • (1954) Naval Research Logistics Quarterly , vol.1 , Issue.1 , pp. 61-68
    • Johnson, S.1
  • 8
    • 58349103684 scopus 로고    scopus 로고
    • An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model
    • Kuo, I-H., Horng, S-J., Kao, T-W., Lin, T-L., Lee, C-L., Terano, T. and Pan, Y. (2009) 'An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model', Expert Systems with Applications, Vol. 36, No. 3, pp. 7027-7032.
    • (2009) Expert Systems with Applications , vol.36 , Issue.3 , pp. 7027-7032
    • Kuo, I.-H.1    Horng, S.-J.2    Kao, T.-W.3    Lin, T.-L.4    Lee, C.-L.5    Terano, T.6    Pan, Y.7
  • 9
    • 80053211943 scopus 로고    scopus 로고
    • An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines
    • Lei, D. and Wang, T. (2011) 'An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines', Computers & Industrial Engineering, Vol. 61, No. 3, pp. 739-743.
    • (2011) Computers & Industrial Engineering , vol.61 , Issue.3 , pp. 739-743
    • Lei, D.1    Wang, T.2
  • 10
    • 33847609606 scopus 로고    scopus 로고
    • A discrete version of particle swarm optimization for flowshop scheduling problems
    • DOI 10.1016/j.cor.2005.11.017, PII S0305054805003643
    • Liao, C-J., Tseng, C-T. and Luarn, P. (2007) 'A discrete version of particle swarm optimization for flow shop scheduling problems', Computers & Operations Research, Vol. 34, No. 10, pp. 3099-3111. (Pubitemid 46356739)
    • (2007) Computers and Operations Research , vol.34 , Issue.10 , pp. 3099-3111
    • Liao, C.-J.1    Chao-Tang Tseng2    Luarn, P.3
  • 11
    • 38749118677 scopus 로고    scopus 로고
    • An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
    • DOI 10.1016/j.cor.2006.12.013, PII S0305054806003169
    • Liu, B., Wang, L. and Jin, Y-H. (2008) 'An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers', Computers & Operations Research, Vol. 35, No. 9, pp. 2791-2806. (Pubitemid 351186803)
    • (2008) Computers and Operations Research , vol.35 , Issue.9 , pp. 2791-2806
    • Liu, B.1    Wang, L.2    Jin, Y.-H.3
  • 12
    • 0030241443 scopus 로고    scopus 로고
    • Genetic algorithms for flowshop scheduling problems
    • DOI 10.1016/0360-8352(96)00053-8
    • Murata, T., Ishibuchi, H. and Tanaka, H. (1996) 'Genetic algorithms for flowshop scheduling problems', Computers & Industrial Engineering, Vol. 30, No. 4, pp. 1061-1071. (Pubitemid 126375914)
    • (1996) Computers and Industrial Engineering , vol.30 , Issue.4 , pp. 1061-1071
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 13
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • DOI 10.1016/0305-0483(83)90088-9
    • Nawaz, M., Enscore, E., Jr. and Ham, I. (1983) 'A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem', OMEGA, Vol. 11, No. 1, pp. 91-95. (Pubitemid 13193807)
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 14
    • 2942589074 scopus 로고    scopus 로고
    • A novel metaheuristic approach for the flow shop scheduling problem
    • Nearchou, A.C. (2004) 'A novel metaheuristic approach for the flow shop scheduling problem', Engineering Applications of Artificial Intelligence, Vol. 17, No. 3, pp. 289-300.
    • (2004) Engineering Applications of Artificial Intelligence , vol.17 , Issue.3 , pp. 289-300
    • Nearchou, A.C.1
  • 16
    • 0032050653 scopus 로고    scopus 로고
    • The flow shop with parallel machines: A tabu search approach
    • PII S0377221797002609
    • Nowicki, E. and Smutnicki, C. (1998) 'The flow shop with parallel machines: A Tabu search approach', European Journal of Operational Research, Vol. 106, Nos. 2-3, pp. 226-253. (Pubitemid 128399650)
    • (1998) European Journal of Operational Research , vol.106 , Issue.2-3 , pp. 226-253
    • Nowicki, E.1    Smutnicki, C.2
  • 17
    • 28244447023 scopus 로고    scopus 로고
    • Scheduling flow shops using differential evolution algorithm
    • DOI 10.1016/j.ejor.2004.08.043, PII S0377221704006599
    • Onwubolu, G. and Davendra, D. (2006) 'Scheduling flowshops using differential evolution algorithm', European Journal of Operational Research, Vol. 171, No. 2, pp. 674-692. (Pubitemid 41706221)
    • (2006) European Journal of Operational Research , vol.171 , Issue.2 , pp. 674-692
    • Onwubolu, G.1    Davendra, D.2
  • 19
    • 13444251134 scopus 로고    scopus 로고
    • A comprehensive review and evaluation of permutation flowshop heuristics
    • Ruiz, R. and Maroto, C. (2005) 'A comprehensive review and evaluation of permutation flowshop heuristics', European Journal of Operational Research, Vol. 165, No. 2, pp. 479-794.
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 479-794
    • Ruiz, R.1    Maroto, C.2
  • 20
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    • DOI 10.1016/j.ejor.2005.12.009, PII S0377221705008507
    • Ruiz, R. and Stutzle, T. (2007) 'A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem', European Journal of Operational Research, Vol. 177, No. 3, pp. 2033-2049. (Pubitemid 44712036)
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 2033-2049
    • Ruiz, R.1    Stutzle, T.2
  • 24
    • 13544263208 scopus 로고    scopus 로고
    • A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
    • DOI 10.1016/j.ejor.2004.07.020, PII S0377221704004771, Multicriteria Scheduling
    • Varadharajan, T.K. and Rajendran, C. (2005) 'A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs', European Journal of Operational Research, Vol. 167, No. 3, pp. 772-795. (Pubitemid 40220090)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 772-795
    • Varadharajan, T.K.1    Rajendran, C.2
  • 27
    • 34249903338 scopus 로고    scopus 로고
    • Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems
    • Ying, K.C. and Lin, S.W. (2007) 'Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems', International Journal of Advanced Manufacturing Technology, Vol. 33, Nos. 7-8, pp. 793-802.
    • (2007) International Journal of Advanced Manufacturing Technology , vol.33 , Issue.7-8 , pp. 793-802
    • Ying, K.C.1    Lin, S.W.2


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