메뉴 건너뛰기




Volumn 168, Issue 1, 2009, Pages 23-39

Nested partitions for the large-scale extended job shop scheduling problem

Author keywords

Dispatching rules; Job shop; Nested partitions

Indexed keywords


EID: 62949114480     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0370-x     Document Type: Article
Times cited : (13)

References (17)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • J. Adams E. Balas D. Zawack 1988 The shifting bottleneck procedure for job shop scheduling Management Science 34 3 391 401
    • (1988) Management Science , vol.34 , Issue.3 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0002381223 scopus 로고
    • Machine sequencing via disjunctive graphs: An implicit enumeration algorithm
    • E. Balas 1969 Machine sequencing via disjunctive graphs: an implicit enumeration algorithm Operations Research 17 941 957
    • (1969) Operations Research , vol.17 , pp. 941-957
    • Balas, E.1
  • 3
    • 0020013653 scopus 로고
    • State-of-the-art survey of dispatching rules for manufacturing job shop operations
    • 10.1080/00207548208947745
    • J. Blackstone D. Phillips G. Hogg 1982 State-of-the-art survey of dispatching rules for manufacturing job shop operations International Journal of Production Research 20 1 27 45 10.1080/00207548208947745
    • (1982) International Journal of Production Research , vol.20 , Issue.1 , pp. 27-45
    • Blackstone, J.1    Phillips, D.2    Hogg, G.3
  • 4
    • 43949161199 scopus 로고
    • A branch and bound algorithm for the job-shop scheduling problem
    • 10.1016/0166-218X(94)90204-6
    • P. Brucker B. Jurisch B. Sievers 1994 A branch and bound algorithm for the job-shop scheduling problem Discrete Applied Mathematics 49 107 127 10.1016/0166-218X(94)90204-6
    • (1994) Discrete Applied Mathematics , vol.49 , pp. 107-127
    • Brucker, P.1    Jurisch, B.2    Sievers, B.3
  • 5
    • 0000165767 scopus 로고
    • An algorithm for solving the job-shop problem
    • J. Carlier E. Pinson 1989 An algorithm for solving the job-shop problem Management Science 35 2 164 176
    • (1989) Management Science , vol.35 , Issue.2 , pp. 164-176
    • Carlier, J.1    Pinson, E.2
  • 6
    • 0028413489 scopus 로고
    • Scheduling products with bills of materials using an improved Lagrangian relaxation technique
    • 10.1109/70.282535
    • C. Czerwinski P. Luh 1994 Scheduling products with bills of materials using an improved Lagrangian relaxation technique IEEE Transactions on Robotics and Automation 10 2 99 111 10.1109/70.282535
    • (1994) IEEE Transactions on Robotics and Automation , vol.10 , Issue.2 , pp. 99-111
    • Czerwinski, C.1    Luh, P.2
  • 7
    • 34250074609 scopus 로고
    • Applying tabu search to the job-shop scheduling problem
    • 10.1007/BF02023076
    • M. Dell'Amico M. Trubian 1993 Applying tabu search to the job-shop scheduling problem Annals of Operations Research 41 231 251 10.1007/BF02023076
    • (1993) Annals of Operations Research , vol.41 , pp. 231-251
    • Dell'Amico, M.1    Trubian, M.2
  • 8
    • 0001947856 scopus 로고
    • Probabilistic learning combinations of local job-shop scheduling rules
    • Prentice-Hall Englewood Cliffs
    • Fisher, H., & Thompson, G. (1963). Probabilistic learning combinations of local job-shop scheduling rules. In J. Muth & G. Thompson (Eds.), Industrial scheduling. Englewood Cliffs: Prentice-Hall.
    • (1963) Industrial Scheduling
    • Fisher, H.1    Thompson, G.2    Muth, J.3    Thompson, G.4
  • 9
    • 34548032213 scopus 로고    scopus 로고
    • Erp systems success: An empirical analysis of how two organizational stakeholder groups prioritize and evaluate relevant measures
    • 10.1080/17517570601088539
    • P. Ifinedo N. Nahar 2007 Erp systems success: an empirical analysis of how two organizational stakeholder groups prioritize and evaluate relevant measures Enterprise Information Systems 1 1 25 48 10.1080/17517570601088539
    • (2007) Enterprise Information Systems , vol.1 , Issue.1 , pp. 25-48
    • Ifinedo, P.1    Nahar, N.2
  • 10
    • 17444396374 scopus 로고    scopus 로고
    • An advanced tabu search algorithm for the job shop problem
    • E. Nowicki C. Smutnicki 1996 An advanced tabu search algorithm for the job shop problem Journal of Scheduling 42 145 159
    • (1996) Journal of Scheduling , vol.42 , pp. 145-159
    • Nowicki, E.1    Smutnicki, C.2
  • 13
    • 0034179713 scopus 로고    scopus 로고
    • Nested partitions method for global optimization
    • 10.1287/opre.48.3.390.12436
    • L. Shi S. Ó lafsson 2000 Nested partitions method for global optimization Operations Research 48 3 390 407 10.1287/opre.48.3.390.12436
    • (2000) Operations Research , vol.48 , Issue.3 , pp. 390-407
    • Shi, L.1
  • 14
    • 12844288684 scopus 로고    scopus 로고
    • An efficient search method for job-shop scheduling problems
    • 10.1109/TASE.2004.829418
    • L. Shi Y. Pan 2005 An efficient search method for job-shop scheduling problems IEEE Transactions Automation Science and Engineering 2 1 73 77 10.1109/TASE.2004.829418
    • (2005) IEEE Transactions Automation Science and Engineering , vol.2 , Issue.1 , pp. 73-77
    • Shi, L.1    Pan, Y.2
  • 17
    • 85012764422 scopus 로고
    • Advances in the theory and practice of scheduling. Advances in industrial systems
    • K. White 1990 Advances in the theory and practice of scheduling. Advances in industrial systems Control and Dynamic Systems 37 115 158
    • (1990) Control and Dynamic Systems , vol.37 , pp. 115-158
    • White, K.1


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