메뉴 건너뛰기




Volumn 33, Issue 5, 2005, Pages 497-501

Minimizing flow-time on a single machine with integer batch sizes

Author keywords

Deterministic batch scheduling; Flow time; Single machine

Indexed keywords

ALGORITHMS; FUNCTIONS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

EID: 19944397854     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.09.007     Document Type: Article
Times cited : (35)

References (11)
  • 1
    • 40849105768 scopus 로고
    • The complexity of one-machine batching problems
    • S. Albers, and P. Brucker The complexity of one-machine batching problems Discrete Appl. Math. 47 1993 87 107
    • (1993) Discrete Appl. Math. , vol.47 , pp. 87-107
    • Albers, S.1    Brucker, P.2
  • 2
    • 0024664606 scopus 로고
    • Optimal scheduling of products with two subassemblies on a single machine
    • E.G. Coffman, A. Nozari, and M. Yannakakis Optimal scheduling of products with two subassemblies on a single machine Oper. Res. 37 1989 426 436
    • (1989) Oper. Res. , vol.37 , pp. 426-436
    • Coffman, E.G.1    Nozari, A.2    Yannakakis, M.3
  • 3
    • 0023366055 scopus 로고
    • Batching to minimize flow times on one machine
    • G. Dobson, U.S. Karmarkar, and J.L. Rummel Batching to minimize flow times on one machine Manage. Sci. 33 1987 784 799
    • (1987) Manage. Sci. , vol.33 , pp. 784-799
    • Dobson, G.1    Karmarkar, U.S.2    Rummel, J.L.3
  • 4
    • 0027660382 scopus 로고
    • Analysis of heuristics for preemptive parallel machine scheduling with batch setup times
    • C.L. Monma, and C.N. Potts Analysis of heuristics for preemptive parallel machine scheduling with batch setup times Oper. Res. 41 1993 981 993
    • (1993) Oper. Res. , vol.41 , pp. 981-993
    • Monma, C.L.1    Potts, C.N.2
  • 6
    • 38249029546 scopus 로고
    • One-pass batching algorithms for the one-machine problem
    • D. Naddef, and C. Santos One-pass batching algorithms for the one-machine problem Discrete Appl. Math. 21 1988 133 145
    • (1988) Discrete Appl. Math. , vol.21 , pp. 133-145
    • Naddef, D.1    Santos, C.2
  • 7
    • 0033895628 scopus 로고    scopus 로고
    • Scheduling with batching: A review
    • C.N. Potts, and M. Kovalyov Scheduling with batching a review Europ. J. Oper. Res. 120 2000 228 249
    • (2000) Europ. J. Oper. Res. , vol.120 , pp. 228-249
    • Potts, C.N.1    Kovalyov, M.2
  • 8
    • 84974861854 scopus 로고
    • Integrating scheduling and batching lot-sizing: A review of algorithms and complexity
    • C.N. Potts, and L.N. Van Wassenhove Integrating scheduling and batching lot-sizing a review of algorithms and complexity J. Oper. Res. Soc. 43 1992 395 406
    • (1992) J. Oper. Res. Soc. , vol.43 , pp. 395-406
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 9
    • 0022132659 scopus 로고
    • Batching single operation manufacturing systems
    • C. Santos, and M. Magazine Batching single operation manufacturing systems Oper. Res. Lett. 4 1985 99 103
    • (1985) Oper. Res. Lett. , vol.4 , pp. 99-103
    • Santos, C.1    Magazine, M.2
  • 10
    • 0026860832 scopus 로고
    • A polynomial algorithm for a one machine batching problem
    • D.F. Shallcross A polynomial algorithm for a one machine batching problem Oper. Res. Lett. 11 1992 213 218
    • (1992) Oper. Res. Lett. , vol.11 , pp. 213-218
    • Shallcross, D.F.1
  • 11
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • S. Webster, and K.R. Baker Scheduling groups of jobs on a single machine Oper. Res. 43 1995 692 703
    • (1995) Oper. Res. , vol.43 , pp. 692-703
    • Webster, S.1    Baker, K.R.2


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