메뉴 건너뛰기




Volumn 47, Issue , 2009, Pages 43-59

AEON: Synthesizing scheduling algorithms from high-level models

Author keywords

Constraints; Job shop; Local search; Modelling; Scheduling

Indexed keywords


EID: 84888582489     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-88843-9_3     Document Type: Article
Times cited : (18)

References (13)
  • 1
    • 0001178278 scopus 로고
    • A non-numerical approach to production scheduling problems
    • Akers S, Friedman J (1955) A non-numerical approach to production scheduling problems. Operations Research 3:429-442
    • (1955) Operations Research , vol.3 , pp. 429-442
    • Akers, S.1    Friedman, J.2
  • 2
    • 34250074609 scopus 로고
    • Applying tabu search to the job-shop scheduling problem
    • Dell'Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 41:231-252
    • (1993) Annals of Operations Research , vol.41 , pp. 231-252
    • Dell'Amico, M.1    Trubian, M.2
  • 3
    • 0030788844 scopus 로고    scopus 로고
    • Psplib-a project scheduling problem library
    • Kolisch R, Sprecher A (1997) Psplib-a project scheduling problem library. European Journal of Operational Research 96:205-216, URL citeseer. ist. psu. edu/kolisch96psplib. html
    • (1997) European Journal of Operational Research , vol.96 , pp. 205-216
    • Kolisch, R.1    Sprecher, A.2
  • 4
    • 69849090546 scopus 로고    scopus 로고
    • Self-adapting large neighborhood search: Application to single-mode scheduling problems
    • In Paris
    • Laborie P, Godard D (2007) Self-adapting large neighborhood search: Application to single-mode scheduling problems. In Proceedings MISTA-07, Paris
    • (2007) Proceedings MISTA-07
    • Laborie, P.1    Godard, D.2
  • 5
    • 0033080204 scopus 로고    scopus 로고
    • A tabu search algorithm for the open shop scheduling problem
    • Liaw CF (1999) A tabu search algorithm for the open shop scheduling problem. Computers and Operations Research 26:109-126
    • (1999) Computers and Operations Research , vol.26 , pp. 109-126
    • Liaw, C.F.1
  • 7
    • 33846019176 scopus 로고    scopus 로고
    • Impact-based search strategies for constraint programming
    • In: CP 2004, Toronto (Canada)
    • Refalo P (2004) Impact-based search strategies for constraint programming. In: CP 2004, Toronto (Canada), pp 557-571
    • (2004) , pp. 557-571
    • Refalo, P.1
  • 8
    • 26444520724 scopus 로고    scopus 로고
    • Scheduling abstractions for local search
    • In: CP-AI-OR'04, Nice
    • Van Hentenryck P, Michel L (2004) Scheduling abstractions for local search. In: CP-AI-OR'04, Nice, pp 319-334
    • (2004) , pp. 319-334
    • Van Hentenryck, P.1    Michel, L.2
  • 12
    • 34047181443 scopus 로고    scopus 로고
    • A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
    • Zhang CY, Li P, Rao Y, Guan Z (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research 34:3229-3242
    • (2007) Computers & Operations Research , vol.34 , pp. 3229-3242
    • Zhang, C.Y.1    Li, P.2    Rao, Y.3    Guan, Z.4
  • 13
    • 34250219585 scopus 로고    scopus 로고
    • A very fast ts/sa algorithm for the job shop scheduling problem
    • Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast ts/sa algorithm for the job shop scheduling problem. Computers & Operations Research 35:282-294
    • (2008) Computers & Operations Research , vol.35 , pp. 282-294
    • Zhang, C.Y.1    Li, P.2    Rao, Y.3    Guan, Z.4


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