메뉴 건너뛰기




Volumn 31, Issue 1, 2003, Pages 42-48

On scheduling an unbounded batch machine

Author keywords

Batch processing; Complexity; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; POLYNOMIALS; PROBLEM SOLVING;

EID: 0037211738     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00186-4     Document Type: Article
Times cited : (39)

References (11)
  • 4
    • 0035427205 scopus 로고    scopus 로고
    • Scheduling jobs with release dates and deadlines on a batch processing machine
    • Cheng T.C.E., Liu Z., Yu W. Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Trans. 33:2001;685-690.
    • (2001) IIE Trans. , vol.33 , pp. 685-690
    • Cheng, T.C.E.1    Liu, Z.2    Yu, W.3
  • 5
    • 84957794163 scopus 로고    scopus 로고
    • Minimizing mean response time in batch processing system
    • Springer, Berlin
    • X. Deng, Y. Zhang, Minimizing Mean Response Time in Batch Processing System, Lecture Notes in Computer Science, Vol. 1627, Springer, Berlin, 1999, pp. 231-240.
    • (1999) Lecture Notes in Computer Science , vol.1627 , pp. 231-240
    • Deng, X.1    Zhang, Y.2
  • 6
    • 0345901561 scopus 로고
    • Sequencing and scheduling: Algorithms and complexity
    • S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Logistics of Production and Inventory, North-Holland, Amsterdam
    • E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445-522.
    • (1993) Handbooks in Operations Research and Management Science , vol.4 , pp. 445-522
    • Lawler, E.L.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3    Shmoys, D.B.4
  • 7
    • 0032804081 scopus 로고    scopus 로고
    • Minimizing makespan on a single batch processing machine with dynamic job arrivals
    • Lee C.-Y., Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int. J. Prod. Res. 37:1999;219-236.
    • (1999) Int. J. Prod. Res. , vol.37 , pp. 219-236
    • Lee, C.-Y.1    Uzsoy, R.2
  • 8
    • 0026898494 scopus 로고
    • Efficient algorithms for scheduling semiconductor burn-in operations
    • Lee C.-Y., Uzsoy R., Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40:1992;764-775.
    • (1992) Oper. Res. , vol.40 , pp. 764-775
    • Lee, C.-Y.1    Uzsoy, R.2    Martin-Vega, L.A.3
  • 9
    • 0031077278 scopus 로고    scopus 로고
    • Scheduling with agreeable release times and due dates on a batch processing machine
    • Li C.-L., Lee C.-Y. Scheduling with agreeable release times and due dates on a batch processing machine. Eur. J. Oper. Res. 96:1997;564-569.
    • (1997) Eur. J. Oper. Res. , vol.96 , pp. 564-569
    • Li, C.-L.1    Lee, C.-Y.2
  • 10
    • 0000368292 scopus 로고    scopus 로고
    • Scheduling one batch processor subject to job release dates
    • Liu Z., Yu W. Scheduling one batch processor subject to job release dates. Discrete Appl. Math. 105:2000;129-136.
    • (2000) Discrete Appl. Math. , vol.105 , pp. 129-136
    • Liu, Z.1    Yu, W.2
  • 11
    • 0033895628 scopus 로고    scopus 로고
    • Scheduling with batching: A review
    • Potts C.N., Kovalyov M.Y. Scheduling with batching. a review Eur. J. Oper. Res. 120:2000;228-249.
    • (2000) Eur. J. Oper. Res. , vol.120 , pp. 228-249
    • Potts, C.N.1    Kovalyov, M.Y.2


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