메뉴 건너뛰기




Volumn 27, Issue 5, 2000, Pages 193-197

On-line scheduling on a single machine: Maximizing the number of early jobs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING;

EID: 0034498066     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00061-4     Document Type: Article
Times cited : (48)

References (9)
  • 1
    • 0032627791 scopus 로고    scopus 로고
    • 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
    • 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs Oper. Res. Lett. 24:1999;175-180.
    • (1999) Oper. Res. Lett. , vol.24 , pp. 175-180
    • Baptiste, P.1
  • 3
    • 84896693246 scopus 로고    scopus 로고
    • Maximizing job completions on-line, Proceedings of the Sixth European Symposium on Algorithms (ESA'98)
    • B. Kalyanasundaram, K. Pruhs, Maximizing job completions on-line, Proceedings of the Sixth European Symposium on Algorithms (ESA'98), Springer Lecture Notes in Computer Science, vol. 1461, 1998, pp. 235-246.
    • (1998) Springer Lecture Notes in Computer Science , vol.1461 , pp. 235-246
    • Kalyanasundaram, B.1    Pruhs, K.2
  • 4
    • 0000889797 scopus 로고
    • A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
    • Lawler E.L. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26:1990;125-133.
    • (1990) Ann. Oper. Res. , vol.26 , pp. 125-133
    • Lawler, E.L.1


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