메뉴 건너뛰기




Volumn , Issue , 2011, Pages

A binary integer linear programming-based approach for solving the allocation problem in multiprocessor partitioned scheduling

Author keywords

Balas' additive algorithm; binary integer programming; multiprocessor real time scheduling; partitioned scheme

Indexed keywords

ADDITIVE METHODS; ALLOCATION PROBLEMS; BINARY INTEGER PROGRAMMING; BINARY INTEGERS; EARLIEST DEADLINE FIRST; PARTITIONED SCHEME; PERIODIC TASKS; PRACTICAL PROBLEMS; REAL TIME SCHEDULING; SMALL SIZE;

EID: 84855801218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICEEE.2011.6106190     Document Type: Conference Paper
Times cited : (2)

References (17)
  • 2
    • 79957581233 scopus 로고    scopus 로고
    • A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems
    • accepted for publication in
    • R. Davis, A. Burns, "A Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems", accepted for publication in ACM Computing Surveys, 2011.
    • (2011) ACM Computing Surveys
    • Davis, R.1    Burns, A.2
  • 3
    • 0020271514 scopus 로고
    • On the complexity of fixed-priority scheduling of periodic real-time tasks
    • December
    • J. Y. Leung, J. Whitehead, "On the complexity of fixed-priority scheduling of periodic real-time tasks", in Performance Evaluation (Netherlands), Vol. 2, No. 4, pp.237-250, December 1982.
    • (1982) Performance Evaluation (Netherlands) , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.Y.1    Whitehead, J.2
  • 4
    • 34547427292 scopus 로고    scopus 로고
    • Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results
    • P. Oliveto, J. He, X. Yao, "Time Complexity of Evolutionary Algorithms for Combinatorial Optimization: A Decade of Results", in International Journal of Automation and Computing, Vol. 3, No. 4, pp. 281-293, 2007.
    • (2007) International Journal of Automation and Computing , vol.3 , Issue.4 , pp. 281-293
    • Oliveto, P.1    He, J.2    Yao, X.3
  • 8
    • 84958977914 scopus 로고
    • Outline of an algorithm for integer solutions to linear programs
    • R. E. Gomory, "Outline of an algorithm for integer solutions to linear programs", in Bulletin of the American Mathematical Society, Vol. 64, No. 5, pp. 275-278, 1958.
    • (1958) Bulletin of the American Mathematical Society , vol.64 , Issue.5 , pp. 275-278
    • Gomory, R.E.1
  • 9
    • 0001173632 scopus 로고
    • An automatic method of solving discrete programming problems
    • July
    • A. H. Land, A. G. Doig, "An automatic method of solving discrete programming problems", in Econometrica, Vol. 28, No. 3, pp. 497-520, July 1960.
    • (1960) Econometrica , vol.28 , Issue.3 , pp. 497-520
    • Land, A.H.1    Doig, A.G.2
  • 11
    • 0001488483 scopus 로고
    • An additive algorithm for solving linear programs with zero-one variables
    • August
    • E. Balas, "An Additive Algorithm for Solving Linear Programs with Zero-One Variables", in Operations Research, Vol. 13, No. 3, pp. 517-549, August 1965.
    • (1965) Operations Research , vol.13 , Issue.3 , pp. 517-549
    • Balas, E.1
  • 12
    • 0001606686 scopus 로고
    • Integer programming by implicit enumeration and balas' method
    • April
    • A. Geoffrion, "Integer Programming by Implicit Enumeration and Balas' Method", in SIAM Review, Vol. 9, No. 2 pp. 178-190, April 1967
    • (1967) SIAM Review , vol.9 , Issue.2 , pp. 178-190
    • Geoffrion, A.1
  • 14
    • 0001497251 scopus 로고
    • Computational experience with variants of the balas algorithm applied to the selection of R&D projects
    • Series A, Sciences, May
    • C. Petersen, "Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects", in Management Science, Vol. 13, No. 9, Series A, Sciences, pp. 736-750, May 1967.
    • (1967) Management Science , vol.13 , Issue.9 , pp. 736-750
    • Petersen, C.1
  • 16
    • 0001526391 scopus 로고
    • An improved implicit enumeration approach for integer programming
    • May-June
    • A. Geoffrion, "An Improved Implicit Enumeration Approach for Integer Programming", in Operations Research, Vol. 17, No. 3, pp. 437-454, May-June 1969.
    • (1969) Operations Research , vol.17 , Issue.3 , pp. 437-454
    • Geoffrion, A.1
  • 17
    • 0027201278 scopus 로고
    • Benchmarks for basic scheduling problems
    • January
    • E. Taillard, "Benchmarks for basic scheduling problems", in European Journal of Operational Research, Vol. 64, No. 2, pp. 278-285, January 1993.
    • (1993) European Journal of Operational Research , vol.64 , Issue.2 , pp. 278-285
    • Taillard, E.1


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