메뉴 건너뛰기




Volumn 8, Issue 2, 1996, Pages 144-157

Constraint propagation based scheduling of job shops

Author keywords

Constraint propagation; Job shop

Indexed keywords


EID: 0005013512     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.8.2.144     Document Type: Article
Times cited : (17)

References (12)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottle-neck procedure for job shop scheduling
    • J. ADAMS, E. BALAS, and D. ZAWACK, 1988. The Shifting Bottle-neck Procedure for Job Shop Scheduling, Management Science 34, 391-401.
    • (1988) Management Science , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0040402369 scopus 로고
    • A graphical approach to production scheduling problems
    • S.B. AKERS, 1956. A Graphical Approach to Production Scheduling Problems, Operations Research 4, 244-245.
    • (1956) Operations Research , vol.4 , pp. 244-245
    • Akers, S.B.1
  • 3
    • 0026126118 scopus 로고
    • A computational study of the job-shop scheduling problem
    • D. APPLEGATE and W. COOK, 1991. A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3, 149-156.
    • (1991) ORSA Journal on Computing , vol.3 , pp. 149-156
    • Applegate, D.1    Cook, W.2
  • 4
    • 0029195265 scopus 로고
    • One machine scheduling with delayed precedence constraints
    • E. BALAS, J.K. LENSTRA, and A. VAZACOPOULOS, 1995. One Machine Scheduling with Delayed Precedence Constraints, Management Science 41, 94-109.
    • (1995) Management Science , vol.41 , pp. 94-109
    • Balas, E.1    Lenstra, J.K.2    Vazacopoulos, A.3
  • 5
    • 0043058211 scopus 로고
    • Guided local search with shifting bottleneck for job shop scheduling
    • Carnegie Mellon University, Pittsburgh, PA
    • E. BALAS and A. VAZACOPOULOS, 1995. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling, Management Science Research Report MSRR-609, Carnegie Mellon University, Pittsburgh, PA.
    • (1995) Management Science Research Report , vol.MSRR-609
    • Balas, E.1    Vazacopoulos, A.2
  • 12
    • 0024142036 scopus 로고
    • An efficient algorithm for the job-shop problem with two jobs
    • P. BRUCKER, 1988. An Efficient Algorithm for the Job-Shop Problem with Two Jobs, Computing 40, 353-359.
    • (1988) Computing , vol.40 , pp. 353-359
    • Brucker, P.1


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