메뉴 건너뛰기




Volumn 52, Issue 4, 2005, Pages 312-320

A logistics scheduling model: Inventory cost reduction by batching

Author keywords

Batching; Branch and bound; Inventory control; Logistics scheduling

Indexed keywords

ALGORITHMS; DECISION THEORY; INVENTORY CONTROL; LOGISTICS; MATHEMATICAL MODELS; OPTIMIZATION;

EID: 18744400261     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20078     Document Type: Article
Times cited : (24)

References (26)
  • 1
    • 0030289711 scopus 로고    scopus 로고
    • Lot scheduling in a two-machine cell with swapping devices
    • A. Agnetis, D. Pacciarelli, and F. Rossi, Lot scheduling in a two-machine cell with swapping devices, IIE Trans 28 (1996), 911-917.
    • (1996) IIE Trans , vol.28 , pp. 911-917
    • Agnetis, A.1    Pacciarelli, D.2    Rossi, F.3
  • 2
    • 0033078550 scopus 로고    scopus 로고
    • On the minimization of total weighted flow time with identical and uniform parallel machines
    • M. Azizoglu and O. Kirca, On the minimization of total weighted flow time with identical and uniform parallel machines, European J Oper Res 113 (1999), 91-100.
    • (1999) European J Oper Res , vol.113 , pp. 91-100
    • Azizoglu, M.1    Kirca, O.2
  • 3
    • 0141957114 scopus 로고    scopus 로고
    • An experimental study of algorithms for weighted completion time scheduling
    • I.D. Baev, W.M. Meleis, and A. Eichenberger, An experimental study of algorithms for weighted completion time scheduling, Algorithmica 33 (2002), 34-51.
    • (2002) Algorithmica , vol.33 , pp. 34-51
    • Baev, I.D.1    Meleis, W.M.2    Eichenberger, A.3
  • 4
    • 0029404820 scopus 로고
    • A time window approach to simultaneous scheduling of machines and material handling system in an FMS
    • U. Bilge and G. Ulusoy, A time window approach to simultaneous scheduling of machines and material handling system in an FMS, Oper Res 43 (1995), 1058-1070.
    • (1995) Oper Res , vol.43 , pp. 1058-1070
    • Bilge, U.1    Ulusoy, G.2
  • 5
    • 0016080006 scopus 로고
    • Scheduling independent tasks to reduce mean finishing time
    • J. Bruno, E.G. Coffman, and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Commun ACM 17 (1974), 382-387.
    • (1974) Commun ACM , vol.17 , pp. 382-387
    • Bruno, J.1    Coffman, E.G.2    Sethi, R.3
  • 6
    • 2642510666 scopus 로고    scopus 로고
    • Machine scheduling with job delivery coordination
    • Y.-C. Chang and C.-Y. Lee, Machine scheduling with job delivery coordination, European J Oper Res 158 (2004), 470-487.
    • (2004) European J Oper Res , vol.158 , pp. 470-487
    • Chang, Y.-C.1    Lee, C.-Y.2
  • 7
    • 0030216821 scopus 로고    scopus 로고
    • Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
    • Z.-L. Chen, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, European J Oper Res 93 (1996), 49-60.
    • (1996) European J Oper Res , vol.93 , pp. 49-60
    • Chen, Z.-L.1
  • 8
    • 0006715283 scopus 로고    scopus 로고
    • Solving parallel machine scheduling problems by column generation
    • Z.-L. Chen and W.B. Powell, Solving parallel machine scheduling problems by column generation, INFORMS J Comput 11 (1999), 78-94.
    • (1999) INFORMS J Comput , vol.11 , pp. 78-94
    • Chen, Z.-L.1    Powell, W.B.2
  • 10
    • 0035561146 scopus 로고    scopus 로고
    • Single supplier scheduling for multiple deliveries
    • T.C.E. Cheng and M.Y. Kovalyov, Single supplier scheduling for multiple deliveries, Ann Oper Res 107 (2001), 51-63.
    • (2001) Ann Oper Res , vol.107 , pp. 51-63
    • Cheng, T.C.E.1    Kovalyov, M.Y.2
  • 11
    • 2342539189 scopus 로고    scopus 로고
    • Supply chain scheduling: Batching and delivery
    • N.G. Hall and C.N. Potts, Supply chain scheduling: Batching and delivery, Oper Res 51 (2003), 566-584.
    • (2003) Oper Res , vol.51 , pp. 566-584
    • Hall, N.G.1    Potts, C.N.2
  • 12
    • 0027906623 scopus 로고
    • On scheduling to minimize earliness-tardiness and batch delivery costs with a common due-date
    • J.W. Herrmann and C.-Y. Lee, On scheduling to minimize earliness-tardiness and batch delivery costs with a common due-date, European J Oper Res 70 (1993), 272-288.
    • (1993) European J Oper Res , vol.70 , pp. 272-288
    • Herrmann, J.W.1    Lee, C.-Y.2
  • 13
    • 0344427189 scopus 로고    scopus 로고
    • Machine scheduling with transportation considerations
    • C.-Y. Lee and Z.-L. Chen, Machine scheduling with transportation considerations, J Sched 4 (2001), 3-24.
    • (2001) J Sched , vol.4 , pp. 3-24
    • Lee, C.-Y.1    Chen, Z.-L.2
  • 14
    • 10444261222 scopus 로고    scopus 로고
    • Machine scheduling with deliveries to multiple customer locations
    • C.-L. Li, G. Vairaktarakis, and C.-Y. Lee, Machine scheduling with deliveries to multiple customer locations, European J Oper Res 164 (2005), 39-51.
    • (2005) European J Oper Res , vol.164 , pp. 39-51
    • Li, C.-L.1    Vairaktarakis, G.2    Lee, C.-Y.3
  • 15
    • 0033895628 scopus 로고    scopus 로고
    • Scheduling with batching: A review
    • C.N. Potts and M.Y. Kovalyov, Scheduling with batching: A review, European J Oper Res 120 (2000), 228-249.
    • (2000) European J Oper Res , vol.120 , pp. 228-249
    • Potts, C.N.1    Kovalyov, M.Y.2
  • 16
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
    • C.N. Potts and L.N. Van Wassenhove, Integrating scheduling with batching and 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
  • 17
    • 0034138331 scopus 로고    scopus 로고
    • A PTAS for minimizing the total weighted completion time on identical parallel machines
    • M. Skutella and G.J. Woeginger, A PTAS for minimizing the total weighted completion time on identical parallel machines, Math Oper Res 25 (2000), 63-75.
    • (2000) Math Oper Res , vol.25 , pp. 63-75
    • Skutella, M.1    Woeginger, G.J.2
  • 18
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • E. Smith, Various optimizers for single-stage production, Naval Res Logist Quart 3 (1956), 59-66.
    • (1956) Naval Res Logist Quart , vol.3 , pp. 59-66
    • Smith, E.1
  • 19
    • 0030790585 scopus 로고    scopus 로고
    • Scheduling a two-machine flowshop with travel times to minimize maximum lateness
    • J.W. Stevens and D.D. Gemmill, Scheduling a two-machine flowshop with travel times to minimize maximum lateness, Int J Prod Res 35 (1997), 1-15.
    • (1997) Int J Prod Res , vol.35 , pp. 1-15
    • Stevens, J.W.1    Gemmill, D.D.2
  • 20
    • 0043099685 scopus 로고    scopus 로고
    • A heuristic for the two-machine open-shop scheduling problem with transportation times
    • V.A. Strusevich, A heuristic for the two-machine open-shop scheduling problem with transportation times, Discrete Appl Math 93 (1999), 287-304.
    • (1999) Discrete Appl Math , vol.93 , pp. 287-304
    • Strusevich, V.A.1
  • 21
    • 0031525145 scopus 로고    scopus 로고
    • Rescheduling on a single machine with part type dependent setup times and due dates
    • A.T. Unal, R. Uzsoy, and A.S. Kiran, Rescheduling on a single machine with part type dependent setup times and due dates, Ann Oper Res 70 (1997), 93-113.
    • (1997) Ann Oper Res , vol.70 , pp. 93-113
    • Unal, A.T.1    Uzsoy, R.2    Kiran, A.S.3
  • 22
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • H. Wagner and T. Whitin, Dynamic version of the economic lot size model, Management Sci 5 (1958), 89-96.
    • (1958) Management Sci , vol.5 , pp. 89-96
    • Wagner, H.1    Whitin, T.2
  • 23
    • 0034319401 scopus 로고    scopus 로고
    • Parallel machine scheduling with batch delivery costs
    • G. Wang and T.C.E. Cheng, Parallel machine scheduling with batch delivery costs, Int J Prod Econom 68 (2000), 177-183.
    • (2000) Int J Prod Econom , vol.68 , pp. 177-183
    • Wang, G.1    Cheng, T.C.E.2
  • 24
    • 0011726269 scopus 로고
    • New bounds for the identical parallel processor weighted flow time problem
    • S. Webster, New bounds for the identical parallel processor weighted flow time problem, Management Sci 38 (1992), 124-136.
    • (1992) Management Sci , vol.38 , pp. 124-136
    • Webster, S.1
  • 25
    • 0029636124 scopus 로고
    • Weighted flow time-bounds for scheduling identical processors
    • S. Webster, Weighted flow time-bounds for scheduling identical processors, European J Oper Res 80 (1995), 103-111.
    • (1995) European J Oper Res , vol.80 , pp. 103-111
    • Webster, S.1
  • 26
    • 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가 분석하여 추출한 것입니다.