메뉴 건너뛰기




Volumn 9, Issue 3, 1996, Pages 261-273

Scheduling as a multi-dimensional placement problem

Author keywords

Constraint satisfaction problems; Knowledge based simulation; Placement problems; Resource allocation; Scheduling

Indexed keywords

AIRPORTS; COMPUTER SIMULATION; CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING; QUEUEING THEORY; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING;

EID: 0030172291     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/0952-1976(96)00017-6     Document Type: Article
Times cited : (24)

References (24)
  • 1
    • 0002514541 scopus 로고
    • Algorithms for constraint satisfaction problems: A survey
    • Kumar V. Algorithms for constraint satisfaction problems: a survey. AI Magazine 13(1), 32-44 (1992).
    • (1992) AI Magazine , vol.13 , Issue.1 , pp. 32-44
    • Kumar, V.1
  • 6
    • 0018480537 scopus 로고
    • A force directed component placement procedure for printed circuit boards
    • Quin N. R. and Breuer M. A. A force directed component placement procedure for printed circuit boards. IEEE Trans. on Circuit and Systems CAS-26, No. (6), 377-388 (1979).
    • (1979) IEEE Trans. on Circuit and Systems , vol.CAS-26 , Issue.6 , pp. 377-388
    • Quin, N.R.1    Breuer, M.A.2
  • 7
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick S., Gelatt C. D. and Vecchi M. P. Optimization by simulated annealing. Science 220, 671-680 (1983).
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 14
    • 0018989929 scopus 로고
    • A min-cut placement algorithm for general cell assemblies based on a graph representation
    • Lauther U., A min-cut placement algorithm for general cell assemblies based on a graph representation. J. Digital Systems 21-34 (1980).
    • (1980) J. Digital Systems , pp. 21-34
    • Lauther, U.1
  • 16
    • 0022199376 scopus 로고
    • An analytical algorithm for placement of arbitrary sized rectangular blocks
    • Sha L. and Dutton R. W., An analytical algorithm for placement of arbitrary sized rectangular blocks. Proc. 22nd ACM/IEEE Design Automation Conf., pp. 602-608 (1985).
    • (1985) Proc. 22nd ACM/IEEE Design Automation Conf. , pp. 602-608
    • Sha, L.1    Dutton, R.W.2
  • 19
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • Mackworth A. K., Consistency in networks of relations. Artificial Intelligence 8, 99-118 (1977).
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.K.1
  • 20
    • 0002680001 scopus 로고
    • Understanding line drawings of scenes with shadows
    • McGraw-Hill
    • Waltz D. L. Understanding line drawings of scenes with shadows. The Psychology of Computer Vision, pp. 19-91. McGraw-Hill (1975).
    • (1975) The Psychology of Computer Vision , pp. 19-91
    • Waltz, D.L.1
  • 22
    • 30244528185 scopus 로고
    • Using object-oriented constraint programming tools to implement flexible "easy-to-use" scheduling systems
    • Cocoa Beach, FL
    • Le Pape C., Using object-oriented constraint programming tools to implement flexible "easy-to-use" scheduling systems. Proc. NSF Workshop on Intelligent, Dynamic Scheduling for Manufacturing, Cocoa Beach, FL (1993).
    • (1993) Proc. NSF Workshop on Intelligent, Dynamic Scheduling for Manufacturing
    • Le Pape, C.1
  • 24
    • 0343616544 scopus 로고
    • Object-oriented constraint programming for transportation problems
    • ILOG SA, France
    • Puget J.-F. Object-oriented constraint programming for transportation problems. ILOG Solver Collected Papers, ILOG SA, France (1994).
    • (1994) ILOG Solver Collected Papers
    • Puget, J.-F.1


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