메뉴 건너뛰기




Volumn 173, Issue 1, 2006, Pages 226-240

Batch scheduling in a two-level supply chain-a focus on the supplier

Author keywords

Batching; Combinatorial optimization; Scheduling; Supply chain

Indexed keywords

ALGORITHMS; COSTS; INDUSTRIAL MANAGEMENT; INVENTORY CONTROL; OPERATIONS RESEARCH; POLYNOMIALS;

EID: 33646094727     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.12.007     Document Type: Article
Times cited : (37)

References (21)
  • 1
    • 40849105768 scopus 로고
    • The complexity of one-machine batching problems
    • Albers S., and Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics 47 (1993) 87-107
    • (1993) Discrete Applied Mathematics , vol.47 , pp. 87-107
    • Albers, S.1    Brucker, P.2
  • 2
    • 0031078986 scopus 로고    scopus 로고
    • Scheduling with batch setup times and earliness-tardiness penalties
    • Chen Z.L. Scheduling with batch setup times and earliness-tardiness penalties. European Journal of Operational Research 96 (1997) 518-537
    • (1997) European Journal of Operational Research , vol.96 , pp. 518-537
    • Chen, Z.L.1
  • 3
    • 33646093823 scopus 로고    scopus 로고
    • Z.L. Chen, N.G. Hall, Supply chain scheduling: Assembly systems, Working Paper, 2000.
  • 8
    • 2342539189 scopus 로고    scopus 로고
    • Supply chain scheduling: Batching and delivery
    • Hall N.G., and Potts C.N. Supply chain scheduling: Batching and delivery. Operations Research 51 (2003) 566-584
    • (2003) Operations Research , vol.51 , pp. 566-584
    • Hall, N.G.1    Potts, C.N.2
  • 9
    • 0001680857 scopus 로고
    • Strongly polynomial algorithms for the high multiplicity scheduling problem
    • Hochbaum D.S., and Shamir R. Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research 39 (1991) 648-653
    • (1991) Operations Research , vol.39 , pp. 648-653
    • Hochbaum, D.S.1    Shamir, R.2
  • 10
    • 0344427189 scopus 로고    scopus 로고
    • Machine scheduling with transportation considerations
    • Lee C.Y., and Chen Z.L. Machine scheduling with transportation considerations. Journal of Scheduling 4 (2001) 3-24
    • (2001) Journal of Scheduling , vol.4 , pp. 3-24
    • Lee, C.Y.1    Chen, Z.L.2
  • 11
    • 84989754383 scopus 로고
    • Minimizing flow time on a single machine with job classes and setup times
    • Mason A.J., and Anderson E.J. Minimizing flow time on a single machine with job classes and setup times. Naval Research Logistics 38 (1991) 333-350
    • (1991) Naval Research Logistics , vol.38 , pp. 333-350
    • Mason, A.J.1    Anderson, E.J.2
  • 12
    • 0024736520 scopus 로고
    • On the complexity of scheduling with batch setup times
    • Monma C.L., and Potts C.N. On the complexity of scheduling with batch setup times. Operations Research 37 (1989) 798-804
    • (1989) Operations Research , vol.37 , pp. 798-804
    • Monma, C.L.1    Potts, C.N.2
  • 13
    • 38249029546 scopus 로고
    • One-pass batching algorithms for the one machine problem
    • Naddef D., and Santos C. One-pass batching algorithms for the one machine problem. Discrete Applied Mathematics 21 (1988) 133-145
    • (1988) Discrete Applied Mathematics , vol.21 , pp. 133-145
    • Naddef, D.1    Santos, C.2
  • 15
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
    • Potts C.N., and Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of Operational Research Society 43 (1992) 395-406
    • (1992) Journal of Operational Research Society , vol.43 , pp. 395-406
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 16
    • 0022132659 scopus 로고
    • Batching in single operation manufacturing systems
    • Santos C., and Magazine M. Batching in single operation manufacturing systems. Operations Research Letters 4 (1985) 99-103
    • (1985) Operations Research Letters , vol.4 , pp. 99-103
    • Santos, C.1    Magazine, M.2
  • 17
    • 0026860832 scopus 로고
    • A polynomial algorithm for a one machine batching problem
    • Shallcross D.F. A polynomial algorithm for a one machine batching problem. Operations Research Letters 11 (1992) 213-218
    • (1992) Operations Research Letters , vol.11 , pp. 213-218
    • Shallcross, D.F.1
  • 19
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • Webster S., and Baker K.R. Scheduling groups of jobs on a single machine. Operations Research 43 (1995) 692-703
    • (1995) Operations Research , vol.43 , pp. 692-703
    • Webster, S.1    Baker, K.R.2
  • 20
    • 0020543858 scopus 로고
    • A hybrid algorithm for simultaneous scheduling of production and distribution in multi-echelon structures
    • Williams J.F. A hybrid algorithm for simultaneous scheduling of production and distribution in multi-echelon structures. Management Science 29 (1981) 77-92
    • (1981) Management Science , vol.29 , pp. 77-92
    • Williams, J.F.1
  • 21
    • 33646110166 scopus 로고    scopus 로고
    • X. Yang, Scheduling with generalized batch delivery dates and earliness penalties, IIE Transactions, in press.


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