메뉴 건너뛰기




Volumn 58, Issue 2, 2010, Pages 428-444

Economic lot-sizing for integrated production and transportation

Author keywords

Inventory production; Lot sizing; Shipment consolidation; Transportation

Indexed keywords

COST STRUCTURE; COST-EFFECTIVE PRODUCTION; DELIVERY COSTS; ECONOMIES OF SCALE; EFFICIENT SOLUTION PROCEDURE; INTEGRATED PRODUCTION; INVENTORY/PRODUCTION; LOT SIZING; LOT SIZING PROBLEMS; NONSTATIONARY; PRODUCTION COST; SHIPMENT CONSOLIDATION; TRANSPORTATION COST; TRANSPORTATION OPERATIONS;

EID: 77951188716     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0727     Document Type: Article
Times cited : (29)

References (34)
  • 1
    • 0001233812 scopus 로고
    • Improved algorithms for economic lot-size problems
    • Aggarwal, A., J. K. Park. 1993. Improved algorithms for economic lot-size problems. Oper. Res. 41 549-571.
    • (1993) Oper. Res. , vol.41 , pp. 549-571
    • Aggarwal, A.1    Park, J.K.2
  • 2
    • 19944381224 scopus 로고    scopus 로고
    • Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach
    • Anily, S., M. Tzur. 2006. Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach. Transportation Sci. 39(5) 233-248.
    • (2006) Transportation Sci. , vol.39 , Issue.5 , pp. 233-248
    • Anily, S.1    Tzur, M.2
  • 3
    • 0035435909 scopus 로고    scopus 로고
    • Capacity acquisition, subcontracting, and lot sizing
    • Atamtürk, A., D. S. Hochbaum. 2001. Capacity acquisition, subcontracting, and lot sizing. Management Sci. 47 1081-1100.
    • (2001) Management Sci. , vol.47 , pp. 1081-1100
    • Atamtürk, A.1    Hochbaum, D.S.2
  • 4
    • 0018153235 scopus 로고
    • An algorithm for the dynamic lot-size problem with time-varying production capacity constraints
    • Baker, K. R., P. Dixon, M. J. Magazine, E. A. Silver. 1978. An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Sci. 24(16) 1710-1720.
    • (1978) Management Sci. , vol.24 , Issue.16 , pp. 1710-1720
    • Baker, K.R.1    Dixon, P.2    Magazine, M.J.3    Silver, E.A.4
  • 5
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • Bitran, G. B., H. H. Yanasse. 1982. Computational complexity of the capacitated lot size problem. Management Sci. 28 1174-1185.
    • (1982) Management Sci. , vol.28 , pp. 1174-1185
    • Bitran, G.B.1    Yanasse, H.H.2
  • 6
    • 0033902373 scopus 로고    scopus 로고
    • Stock replenishment and shipment scheduling for vendor managed inventory systems
    • Çetinkaya, S., C.-Y. Lee. 2000. Stock replenishment and shipment scheduling for vendor managed inventory systems. Management Sci. 46 217-232.
    • (2000) Management Sci. , vol.46 , pp. 217-232
    • Çetinkaya, S.1    Lee, C.-Y.2
  • 7
    • 0036727164 scopus 로고    scopus 로고
    • Outbound transportation: Modeling inventory and cargo capacity
    • Çetinkaya, S., C.-Y. Lee. 2002. Outbound transportation: Modeling inventory and cargo capacity. Naval Res. Logist. 49 531-557.
    • (2002) Naval Res. Logist. , vol.49 , pp. 531-557
    • Çetinkaya, S.1    Lee, C.-Y.2
  • 8
    • 0036877284 scopus 로고    scopus 로고
    • On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures
    • Chan, L. M. A., A. Muriel, Z. Shen, D. Simchi-Levi. 2002a. On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures. Oper. Res. 50(6) 1058-1067.
    • (2002) Oper. Res. , vol.50 , Issue.6 , pp. 1058-1067
    • Chan, L.M.A.1    Muriel, A.2    Shen, Z.3    Simchi-Levi, D.4
  • 9
    • 0036870401 scopus 로고    scopus 로고
    • Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
    • Chan, L. M. A., A. Muriel, Z. Shen, D. Simchi-Levi, C. P. Teo. 2002b. Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Sci. 11 1446-1460.
    • (2002) Management Sci. , vol.11 , pp. 1446-1460
    • Chan, L.M.A.1    Muriel, A.2    Shen, Z.3    Simchi-Levi, D.4    Teo, C.P.5
  • 10
    • 0001537142 scopus 로고
    • 2) algorithm for the NI/G/NI/ND capacitated lot size problem
    • 2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Sci. 34 420-427.
    • (1988) Management Sci. , Issue.34 , pp. 420-427
    • Chung, C.S.1    Lin, C.H.M.2
  • 11
    • 0026208005 scopus 로고
    • A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(n log n) or O(n) time
    • Federgruen, A., M. Tzur. 1991. A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(n log n) or O(n) time. Management Sci. 37 909-925.
    • (1991) Management Sci. , vol.37 , pp. 909-925
    • Federgruen, A.1    Tzur, M.2
  • 12
    • 0002144134 scopus 로고
    • Deterministic replenishment planning with concave costs and capacity constraints
    • Florian, M., M. Klein. 1971. Deterministic replenishment planning with concave costs and capacity constraints. Management Sci. 18 12-20.
    • (1971) Management Sci. , vol.18 , pp. 12-20
    • Florian, M.1    Klein, M.2
  • 13
    • 0019032810 scopus 로고
    • Deterministic replenishment planning: Algorithms and complexity
    • Florian, M., J. K. Lenstra, A. H. G. Rinnooy Kan. 1980. Deterministic replenishment planning: Algorithms and complexity. Management Sci. 26 669-679.
    • (1980) Management Sci. , vol.26 , pp. 669-679
    • Florian, M.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3
  • 14
    • 70449646814 scopus 로고    scopus 로고
    • Inventory replenishment and inbound shipment scheduling under a minimum replenishment policy
    • Hwang, H.-C. 2009. Inventory replenishment and inbound shipment scheduling under a minimum replenishment policy. Transportation Sci. 43(2) 244-264.
    • (2009) Transportation Sci. , vol.43 , Issue.2 , pp. 244-264
    • Hwang, H.-C.1
  • 15
    • 32644445781 scopus 로고    scopus 로고
    • Dynamic lot-sizing model with demand time windows and speculative cost structure
    • Hwang, H.-C., W. Jaruphongsa. 2006. Dynamic lot-sizing model with demand time windows and speculative cost structure. Oper. Res. Lett. 34 251-257.
    • (2006) Oper. Res. Lett. , vol.34 , pp. 251-257
    • Hwang, H.-C.1    Jaruphongsa, W.2
  • 16
    • 18144373806 scopus 로고    scopus 로고
    • A dynamic lot-sizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes
    • Jaruphongsa, W., S. Çetinkaya, C.-Y. Lee. 2005. A dynamic lot-sizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes. IIE Trans. 37 453-467.
    • (2005) IIE Trans. , vol.37 , pp. 453-467
    • Jaruphongsa, W.1    Çetinkaya, S.2    Lee, C.-Y.3
  • 17
    • 4644236596 scopus 로고    scopus 로고
    • Production and distribution lot sizing in a two stage supply chain
    • Kaminsky, P., D. Simchi-Levi. 2003. Production and distribution lot sizing in a two stage supply chain. IIE Trans. 35(11) 1065-1075.
    • (2003) IIE Trans. , vol.35 , Issue.11 , pp. 1065-1075
    • Kaminsky, P.1    Simchi-Levi, D.2
  • 18
    • 0024731859 scopus 로고
    • A solution to the multiple set-up problem with dynamic demand
    • Lee, C.-Y. 1989. A solution to the multiple set-up problem with dynamic demand. IIE Trans. 21 266-270.
    • (1989) IIE Trans. , vol.21 , pp. 266-270
    • Lee, C.-Y.1
  • 19
    • 3042815391 scopus 로고    scopus 로고
    • Inventory replenishment model: Lot sizing versus justin-time delivery
    • Lee, C.-Y. 2004. Inventory replenishment model: Lot sizing versus justin-time delivery. Oper. Res. Lett. 32 581-590.
    • (2004) Oper. Res. Lett. , vol.32 , pp. 581-590
    • Lee, C.-Y.1
  • 20
    • 3042807721 scopus 로고    scopus 로고
    • A dynamic model for inventory lot sizing and outbound shipment scheduling at a thirdparty warehouse
    • Lee, C.-Y., S. Çetinkaya, W. Jaruphongsa. 2003. A dynamic model for inventory lot sizing and outbound shipment scheduling at a thirdparty warehouse. Oper. Res. 51 735-747.
    • (2003) Oper. Res. , vol.51 , pp. 735-747
    • Lee, C.-Y.1    Çetinkaya, S.2    Jaruphongsa, W.3
  • 21
    • 0035494017 scopus 로고    scopus 로고
    • A dynamic lot-sizing model with demand time windows
    • Lee, C.-Y., S. Çetinkaya, A. P. M. Wagelmans. 2001. A dynamic lot-sizing model with demand time windows. Management Sci. 47 1384-1395.
    • (2001) Management Sci. , vol.47 , pp. 1384-1395
    • Lee, C.-Y.1    Çetinkaya, S.2    Wagelmans, A.P.M.3
  • 22
    • 0014564214 scopus 로고
    • Optimal inventory policy with multiple set-up costs
    • Lippman, S. A. 1969. Optimal inventory policy with multiple set-up costs. Management Sci. 16 118-138.
    • (1969) Management Sci. , vol.16 , pp. 118-138
    • Lippman, S.A.1
  • 23
    • 0001705761 scopus 로고
    • Bounded replenishment and inventory models with piecewise concave costs
    • Love, S. F. 1973. Bounded replenishment and inventory models with piecewise concave costs. Management Sci. 20 313-318.
    • (1973) Management Sci. , vol.20 , pp. 313-318
    • Love, S.F.1
  • 24
    • 0001547772 scopus 로고
    • Lot-sizing with constant batches: Formulations and valid inequalities
    • Pochet, Y., L. A. Wolsey. 1993. Lot-sizing with constant batches: Formulations and valid inequalities. Math. Oper. Res. 18(4) 767-785.
    • (1993) Math. Oper. Res. , vol.18 , Issue.4 , pp. 767-785
    • Pochet, Y.1    Wolsey, L.A.2
  • 25
    • 34548699145 scopus 로고    scopus 로고
    • Capacitated production and subcontracting in a serial supply chain
    • Sargut, F. Z., H. E. Romeijn. 2007. Capacitated production and subcontracting in a serial supply chain. IIE Trans. 39 1031-1043.
    • (2007) IIE Trans. , vol.39 , pp. 1031-1043
    • Sargut, F.Z.1    Romeijn, H.E.2
  • 26
    • 0001491020 scopus 로고    scopus 로고
    • 3) algorithm for the economic lot-sizing problem with constant capacities
    • 3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. 42 142-150.
    • (1996) Management Sci. , vol.42 , pp. 142-150
    • Van Hoesel, C.P.M.1    Wagelmans, A.P.M.2
  • 27
    • 0028769392 scopus 로고
    • Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
    • Van Hoesel, C. P. M., A. P. M. Wagelmans, B. Moerman. 1994. Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. Eur. J. Oper. Res. 75 312-331.
    • (1994) Eur. J. Oper. Res. , vol.75 , pp. 312-331
    • Van Hoesel, C.P.M.1    Wagelmans, A.P.M.2    Moerman, B.3
  • 28
    • 27744547914 scopus 로고    scopus 로고
    • Integrated lot-sizing in serial supply chains with production capacities
    • Van Hoesel, S., H. E. Romeijn, D. R. Morales, A. P. M. Wagelmans. 2005. Integrated lot-sizing in serial supply chains with production capacities. Management Sci. 51(11) 1706-1719.
    • (2005) Management Sci. , vol.51 , Issue.11 , pp. 1706-1719
    • Van Hoesel, S.1    Romeijn, H.E.2    Morales, D.R.3    Wagelmans, A.P.M.4
  • 29
    • 38549132496 scopus 로고    scopus 로고
    • Algorithms for single-item lot-sizing problems with constant batch size
    • Van Vyve, M. 2007. Algorithms for single-item lot-sizing problems with constant batch size. Math. Oper. Res. 32(3) 594-613.
    • (2007) Math. Oper. Res. , vol.32 , Issue.3 , pp. 594-613
    • Van Vyve, M.1
  • 30
    • 0000495984 scopus 로고
    • Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
    • Wagelmans, A. P. M., S. Van Hoesel, A. Kolen. 1992. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40 S145-S157.
    • (1992) Oper. Res. , vol.40
    • Wagelmans, A.P.M.1    S. Van Hoesel2    Kolen, A.3
  • 31
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot-size model
    • Wagner, H. M., T. M. Whitin. 1958. Dynamic version of the economic lot-size model. Management Sci. 5 89-97.
    • (1958) Management Sci. , vol.5 , pp. 89-97
    • Wagner, H.M.1    Whitin, T.M.2
  • 32
    • 33645304837 scopus 로고    scopus 로고
    • Lot-sizing with production and delivery time windows A
    • Wolsey, L. A. 2006. Lot-sizing with production and delivery time windows. Math. Programming Ser. A 107 471-489.
    • (2006) Math. Programming Ser. , vol.107 , pp. 471-489
    • Wolsey, L.A.1
  • 33
    • 0002967761 scopus 로고
    • A deterministic multi-period replenishment scheduling model with backlogging
    • Zangwill, W. I. 1966. A deterministic multi-period replenishment scheduling model with backlogging. Management Sci. 13 105-119.
    • (1966) Management Sci. , vol.13 , pp. 105-119
    • Zangwill, W.I.1
  • 34
    • 0000631024 scopus 로고
    • A backlogging model and a multi-echelon model of a dynamic economic lot size replenishment system - A network approach
    • Zangwill, W. I. 1969. A backlogging model and a multi-echelon model of a dynamic economic lot size replenishment system-A network approach. Management Sci. 15 506-527.
    • (1969) Management Sci. , vol.15 , pp. 506-527
    • Zangwill, W.I.1


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