메뉴 건너뛰기




Volumn , Issue , 2001, Pages 348-356

Approximation algorithms for the job interval selection problem and related scheduling problems

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED ANALYSIS; PROBLEM SOLVING; REAL TIME SYSTEMS; RESOURCE ALLOCATION;

EID: 0035179608     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959909     Document Type: Conference Paper
Times cited : (39)

References (28)
  • 3
    • 0001582286 scopus 로고    scopus 로고
    • Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
    • (1999) Journal of Scheduling , vol.2 , pp. 245-252
    • Baptiste, P.1
  • 8
    • 0345848077 scopus 로고
    • Probléme à une machine et algorithmes polynômiaux
    • (1981) Questio , vol.5 , Issue.4 , pp. 219-228
    • Carlier, J.1
  • 24
    • 0000062028 scopus 로고
    • An n-job, one machine sequencing algorithm for minimizing the number of late jobs
    • (1968) Management Science , vol.15 , pp. 102-109
    • Moore, J.M.1


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