메뉴 건너뛰기




Volumn , Issue , 2007, Pages 459-465

Using a bee colony algorithm for neighborhood search in job shop scheduling problems

Author keywords

Honey bee colony; Neighborhood search; Scheduling

Indexed keywords

ANT COLONY OPTIMIZATION; FOOD PRODUCTS; ITERATIVE METHODS; SCHEDULING; TABU SEARCH;

EID: 84857622820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.7148/2007-0459     Document Type: Conference Paper
Times cited : (20)

References (23)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams, J., E. Balas, and D. Zawack. 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling." Management Science, Vol.34, No.3, 391-401.
    • (1988) Management Science , vol.34 , Issue.3 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0021496929 scopus 로고
    • Sequencing rules and due-date assignments in a job shop
    • Baker, K.R. 1984. "Sequencing Rules and Due-date Assignments in a Job Shop." Management Science, Vol.30, No.9, 1093-1104.
    • (1984) Management Science , vol.30 , Issue.9 , pp. 1093-1104
    • Baker, K.R.1
  • 3
    • 0031997369 scopus 로고    scopus 로고
    • Guided local search with shifting bottleneck for job shop scheduling
    • Balas, E. and A. Vazacopoulos. 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling." Management Science, Vol.44, No.2, 262-275. (Pubitemid 128596865)
    • (1998) Management Science , vol.44 , Issue.2 , pp. 262-275
    • Balas, E.1    Vazacopoulos, A.2
  • 4
    • 0020013653 scopus 로고
    • A state-of-the-art survey of dispatching rules for manufacturing job-shop operations
    • Blackstone, J.H., D.T. Phillips and G.L. Hogg. 1982. " A State-of-the-Art Survey of Dispatching Rules for Manufacturing Job-Shop Operations." International Journal of Production Research Vol.20, No.1, 27-45.
    • (1982) International Journal of Production Research , vol.20 , Issue.1 , pp. 27-45
    • Blackstone, J.H.1    Phillips, D.T.2    Hogg, G.L.3
  • 5
    • 18744404504 scopus 로고    scopus 로고
    • An ant colony optimization algorithm for shop scheduling problems
    • DOI 10.1023/B:JMMA.0000038614.39977.6f
    • Blum, C. and M. Sampels. 2004. "An Ant Colony Optimization Algorithm for Shop Scheduling Problems." Journal of Mathematical Modelling and Algorithms, Vol.3, No.3, 285-308. (Pubitemid 40678150)
    • (2004) Journal of Mathematical Modelling and Algorithms , vol.3 , Issue.3 , pp. 285-308
    • Blum, C.1    Sampels, M.2
  • 6
    • 43949161199 scopus 로고
    • A branch and bound algorithm for the job shop scheduling problem
    • Brucker, P., B. Jurisch and B. Sievers. 1994. "A Branch and Bound Algorithm for the Job Shop Scheduling Problem." Discrete Applied Mathematics, Vol.49, No.1, 109-127.
    • (1994) Discrete Applied Mathematics , vol.49 , Issue.1 , pp. 109-127
    • Brucker, P.1    Jurisch, B.2    Sievers, B.3
  • 10
    • 26444441957 scopus 로고    scopus 로고
    • Hierarchical minimization of completion time variance and makespan in jobshops
    • DOI 10.1016/j.cor.2004.09.019, PII S0305054804002424
    • Ganesan, V.K., A.I. Sivakumar, and G. Srinivasan. 2006. "Hierarchical Minimization of Completion Time Variance and Makespan in Jobshops." Computers & Operations Research, Vol.33, No.5, 1345-1367. (Pubitemid 41428295)
    • (2006) Computers and Operations Research , vol.33 , Issue.5 , pp. 1345-1367
    • Ganesan, V.K.1    Sivakumar, A.I.2    Srinivasan, G.3
  • 11
    • 0034818087 scopus 로고    scopus 로고
    • Variable neighborhood search: Principles and applications
    • DOI 10.1016/S0377-2217(00)00100-4
    • Hansen, P. and N. Mladenovic. 2001. "Variable Neighborhood Search: Principles and Applications." European Journal of Operational Research, Vol.130, No.3, 449-467. (Pubitemid 32875304)
    • (2001) European Journal of Operational Research , vol.130 , Issue.3 , pp. 449-467
    • Hansen, P.1    Mladenovic, N.2
  • 12
    • 0033102020 scopus 로고    scopus 로고
    • Deterministic job shop scheduling: Past, present and future
    • Jain. A.S. and S. Meeran. 1999. "Deterministic Job Shop Scheduling: Past, Present and Future." European Journal of Operational Research, Vol.113, No.2, 390-434.
    • (1999) European Journal of Operational Research , vol.113 , Issue.2 , pp. 390-434
    • Jain, A.S.1    Meeran, S.2
  • 14
    • 0003657544 scopus 로고
    • A controlled search simulated annealing method for the general job-shop scheduling problem
    • The University of Texas at Aus-tin, Austin, Texas, USA
    • Matsuo, H., C.J. Suh, and R.S. Sullivan. 1988. "A Controlled Search Simulated Annealing Method for the General Job-Shop Scheduling Problem." Working Paper #03-04-88 (1988), Graduate School of Business, The University of Texas at Aus-tin, Austin, Texas, USA.
    • (1988) Working Paper #03-04-88 (1988), Graduate School of Business
    • Matsuo, H.1    Suh, C.J.2    Sullivan, R.S.3
  • 15
    • 12344257128 scopus 로고    scopus 로고
    • On honey bees and dynamic server allocation in internet hosting centers
    • DOI 10.1177/105971230401200308
    • Nakrani, S. and C. Tovey. 2004. "On Honey Bees and Dynamic Allocation in Internet Hosting Centers." Adaptive Behavior, Vol.12, No.3-4, 223-240. (Pubitemid 40134351)
    • (2004) Adaptive Behavior , vol.12 , Issue.3-4 , pp. 223-240
    • Nakrani, S.1    Tovey, C.2
  • 16
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • Nowicki, E. and C. Smutnicki. 1996. "A Fast Taboo Search Algorithm for the Job Shop Problem." Management Science, Vol.42, No.6, 797-813. (Pubitemid 126577322)
    • (1996) Management Science , vol.42 , Issue.6 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 17
    • 0031198746 scopus 로고    scopus 로고
    • Adaptive scheduling in dynamic flexible manufacturing systems: A dynamic rule selection approach
    • PII S1042296X97059065
    • Park, S.C., N. Raman and M.J. Shaw. 1997. "Adaptive scheduling in Dynamic Flexible Manufacturing Systems: a Dynamic Rule Selection Approach." IEEE Transactions Robotics and Automation, Vol.13 No.4, 486-502. (Pubitemid 127763308)
    • (1997) IEEE Transactions on Robotics and Automation , vol.13 , Issue.4 , pp. 486-502
    • Park, S.C.1    Raman, N.2    Shaw, M.J.3
  • 19
    • 0032649737 scopus 로고    scopus 로고
    • A comparative study of dispatching rules in dynamic flowshops and jobshops
    • Rajendran, C. and O. Holthaus. 1999. "A Comparative Study of Dispatching Rules in Dynamic Flowshops and Jobshops." European Journal of Operational Research, Vol.116, No.1, 156-170.
    • (1999) European Journal of Operational Research , vol.116 , Issue.1 , pp. 156-170
    • Rajendran, C.1    Holthaus, O.2
  • 21
    • 46149121233 scopus 로고    scopus 로고
    • Bee colony optimization - A cooperative learning approach to complex transportation problems
    • Teodorovic, D. and M. Dell'orco. 2005. "Bee colony optimization - A cooperative learning approach to complex transportation problems." Advanced OR and AI Methods in Transportation, 51-60.
    • (2005) Advanced or and AI Methods in Transportation , pp. 51-60
    • Teodorovic, D.1    Dell'Orco, M.2


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