메뉴 건너뛰기




Volumn 4162 LNCS, Issue , 2006, Pages 424-435

Online single machine batch scheduling

Author keywords

Batching; Competitive ratio; Online analysis; Scheduling

Indexed keywords

ALGORITHMS; FINANCIAL DATA PROCESSING; ONLINE SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS;

EID: 33750046896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_37     Document Type: Conference Paper
Times cited : (2)

References (10)
  • 1
    • 3543088593 scopus 로고    scopus 로고
    • On-line scheduling a batch processing system to minimize total weighted job completion time
    • B. Chen, X. Deng, and W. Zang. On-line scheduling a batch processing system to minimize total weighted job completion time. Journal of Combinatorial Optimization, 8:85-95, 2004.
    • (2004) Journal of Combinatorial Optimization , vol.8 , pp. 85-95
    • Chen, B.1    Deng, X.2    Zang, W.3
  • 3
    • 33750042010 scopus 로고    scopus 로고
    • Online scheduling with release times and set-ups
    • DIMACS
    • S. Divakaran and M. Saks. Online scheduling with release times and set-ups. Technical Report 2001-50, DIMACS, 2001.
    • (2001) Technical Report , vol.2001 , Issue.50
    • Divakaran, S.1    Saks, M.2
  • 4
    • 0037453325 scopus 로고    scopus 로고
    • Lower bounds for on-line single-machine scheduling
    • L. Epstein and R. van Stee. Lower bounds for on-line single-machine scheduling. Theoretical Computer Science, 299(1-3):439-450, 2003.
    • (2003) Theoretical Computer Science , vol.299 , Issue.1-3 , pp. 439-450
    • Epstein, L.1    Van Stee, R.2
  • 5
    • 33750057433 scopus 로고    scopus 로고
    • Single machine batch scheduling with release times
    • ETH Zurich
    • B. Gfeller, L. Peeters, B. Weber, and P. Widmayer. Single machine batch scheduling with release times. Technical Report 514, ETH Zurich, 2006. Available at http://www.inf.ethz.ch/research/disstechreps/techreports.
    • (2006) Technical Report , vol.514
    • Gfeller, B.1    Peeters, L.2    Weber, B.3    Widmayer, P.4
  • 6
    • 0026898494 scopus 로고
    • Efficient algorithms for scheduling semiconductor burn-in operations
    • C.Y. Lee, R. Uzsoy, and L.A. Martin-Vega. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40(4):764-775, 1992.
    • (1992) Operations Research , vol.40 , Issue.4 , pp. 764-775
    • Lee, C.Y.1    Uzsoy, R.2    Martin-Vega, L.A.3
  • 7
    • 15244356188 scopus 로고    scopus 로고
    • A flexible on-line scheduling algorithm for batch machine with infinite capacity
    • C.K. Poon and W. Yu. A flexible on-line scheduling algorithm for batch machine with infinite capacity. Annals of Operations Research, 133:175-181, 2005a.
    • (2005) Annals of Operations Research , vol.133 , pp. 175-181
    • Poon, C.K.1    Yu, W.2
  • 8
    • 24144484606 scopus 로고    scopus 로고
    • On-line scheduling algorithms for a batch machine with finite capacity
    • C.K. Poon and W. Yu. On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization, 9:167-186, 2005b.
    • (2005) Journal of Combinatorial Optimization , vol.9 , pp. 167-186
    • Poon, C.K.1    Yu, W.2
  • 10
    • 0035312326 scopus 로고    scopus 로고
    • On-line algorithms for minimizing makespan on batch processing machines
    • G. Zhang, X. Cai, and C.K. Wong. On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48:241-258, 2001.
    • (2001) Naval Research Logistics , vol.48 , pp. 241-258
    • Zhang, G.1    Cai, X.2    Wong, C.K.3


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