메뉴 건너뛰기




Volumn 170, Issue 1, 2005, Pages 185-206

A hybrid method for solving stochastic job shop scheduling problems

Author keywords

Neural networks; Simulated annealing; Stochastic job shop scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 26844467313     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2004.11.036     Document Type: Article
Times cited : (91)

References (16)
  • 3
  • 7
    • 0037149316 scopus 로고    scopus 로고
    • Optimal job-shop scheduling with random operations and cost objectives
    • D.G. Ginzburg, and A. Gonik Optimal job-shop scheduling with random operations and cost objectives Int. J. Prod. Econ. 76 2002 147 157
    • (2002) Int. J. Prod. Econ. , vol.76 , pp. 147-157
    • Ginzburg, D.G.1    Gonik, A.2
  • 8
    • 0033742040 scopus 로고    scopus 로고
    • Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling
    • S. Yang, and D. Wang Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling IEEE Trans. Neural Networks 11 2000 243 256
    • (2000) IEEE Trans. Neural Networks , vol.11 , pp. 243-256
    • Yang, S.1    Wang, D.2
  • 9
    • 26844511675 scopus 로고    scopus 로고
    • http://wwwUbka.uni-karlsruhe.de/cgi-bin/psview/, 1997.
    • (1997)
  • 10
    • 0035546127 scopus 로고    scopus 로고
    • Economic due-date setting in job-shops based on routing and workload dependent flow time distribution functions
    • H.P.G. Van Ooijen, and J.W.M. Bertrand Economic due-date setting in job-shops based on routing and workload dependent flow time distribution functions Int. J. Prod. Econ. 74 2001 261 268
    • (2001) Int. J. Prod. Econ. , vol.74 , pp. 261-268
    • Van Ooijen, H.P.G.1    Bertrand, J.W.M.2
  • 11
    • 0035546163 scopus 로고    scopus 로고
    • On the optimal release time of jobs with random processing times, with extensions to other criteria
    • S.E. Elmaghraby On the optimal release time of jobs with random processing times, with extensions to other criteria Int. J. Prod. Econ. 74 2001 103 113
    • (2001) Int. J. Prod. Econ. , vol.74 , pp. 103-113
    • Elmaghraby, S.E.1
  • 12
    • 0035546051 scopus 로고    scopus 로고
    • Job-shop scheduling with alternative process plans
    • C. Thomalla Job-shop scheduling with alternative process plans Int. J. Prod. Econ. 74 2001 125 134
    • (2001) Int. J. Prod. Econ. , vol.74 , pp. 125-134
    • Thomalla, C.1
  • 13
    • 0035479473 scopus 로고    scopus 로고
    • Computer simulation of due-date setting in multi-machine job shops
    • E. Veral Computer simulation of due-date setting in multi-machine job shops Comput. Ind. Eng. 41 2001 77 94
    • (2001) Comput. Ind. Eng. , vol.41 , pp. 77-94
    • Veral, E.1
  • 14
    • 0032070930 scopus 로고    scopus 로고
    • Job-shop scheduling using neural networks
    • S. Jain, and S. Meeran Job-shop scheduling using neural networks Int. J. Prod. Res. 36 1998 1249 1272
    • (1998) Int. J. Prod. Res. , vol.36 , pp. 1249-1272
    • Jain, S.1    Meeran, S.2
  • 15
    • 0002381070 scopus 로고    scopus 로고
    • Neural network for combinatorial optimization: A review of more than a decade of research
    • K.A. Smith Neural network for combinatorial optimization: A review of more than a decade of research Informs J. Comput. 11 1999 15 34
    • (1999) Informs J. Comput. , vol.11 , pp. 15-34
    • Smith, K.A.1
  • 16
    • 0344614598 scopus 로고    scopus 로고
    • Two simulated annealing-based heuristics for the job shops scheduling problem
    • K. Steinhofel, A. Albrecht, and C.K. Wong Two simulated annealing-based heuristics for the job shops scheduling problem Eur. J. Operational Res. 118 1999 524 548
    • (1999) Eur. J. Operational Res. , vol.118 , pp. 524-548
    • Steinhofel, K.1    Albrecht, A.2    Wong, C.K.3


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