메뉴 건너뛰기




Volumn 38, Issue 4, 2010, Pages 241-245

Uncapacitated two-level lot-sizing

Author keywords

Dynamic programming; Mixed integer programming; Two level lot sizing

Indexed keywords

COMPUTATIONAL COMPARISONS; DYNAMIC PROGRAMS; EQUALITY CONSTRAINTS; EXTENDED FORMULATIONS; LOT SIZING; LOT-SIZING MODELS; MIXED INTEGER PROGRAMMING; MULTIPLE CLIENTS; RUNNING TIME; TWO-LEVEL LOT-SIZING;

EID: 77955304507     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2010.04.001     Document Type: Article
Times cited : (39)

References (19)
  • 1
    • 0001233812 scopus 로고
    • Improved algorithms for economic lot-size problems
    • A. Aggarwal, and J. Park Improved algorithms for economic lot-size problems Operations Research 41 1993 549 571
    • (1993) Operations Research , vol.41 , pp. 549-571
    • Aggarwal, A.1    Park, J.2
  • 2
    • 0024641438 scopus 로고
    • Computational complexity of uncapacitated multi-echelon production planning problems
    • E. Arkin, D. Joneja, and R. Roundy Computational complexity of uncapacitated multi-echelon production planning problems Operations Research Letters 8 1989 61 66
    • (1989) Operations Research Letters , vol.8 , pp. 61-66
    • Arkin, E.1    Joneja, D.2    Roundy, R.3
  • 4
    • 0023456043 scopus 로고
    • Solving multi-item lot-sizing problems using variable definition
    • G.D. Eppen, and R.K. Martin Solving multi-item lot-sizing problems using variable definition Operations Research 35 1987 832 848
    • (1987) Operations Research , vol.35 , pp. 832-848
    • Eppen, G.D.1    Martin, R.K.2
  • 5
    • 0026208005 scopus 로고
    • A simple forward algorithm to solve general dynamic lot-size models with n periods in O (n log n) or O (n) time
    • A. Federgrn, and M. Tzur A simple forward algorithm to solve general dynamic lot-size models with n periods in O (n log n) or O (n) time Management Science 37 1991 909 925
    • (1991) Management Science , vol.37 , pp. 909-925
    • Federgrn, A.1    Tzur, M.2
  • 6
    • 0004601104 scopus 로고    scopus 로고
    • Time-partitioning heuristics: Application to one warehouse, multi-item, multi-retailer lot-sizing problems
    • A. Federgrn, and M. Tzur Time-partitioning heuristics: application to one warehouse, multi-item, multi-retailer lot-sizing problems Naval Research Logistics Quarterly 46 1999 463 486
    • (1999) Naval Research Logistics Quarterly , vol.46 , pp. 463-486
    • Federgrn, A.1    Tzur, M.2
  • 7
    • 0002180205 scopus 로고
    • Plant location, set covering and economic lot sizes: An O (m n) algorithm for structured problems
    • J. Krarup, and O. Bilde Plant location, set covering and economic lot sizes: an O (m n) algorithm for structured problems L. Collatz, Optimierung bei Graphentheoretischen und Ganzzahligen Probleme 1977 Birkhauser Verlag Basel 155 180
    • (1977) Optimierung bei Graphentheoretischen und Ganzzahligen Probleme , pp. 155-180
    • Krarup, J.1    Bilde, O.2
  • 8
    • 3042807721 scopus 로고    scopus 로고
    • A dynamic model for inventory lot-sizing and outbound shipment scheduling at a third-party warehouse
    • C.-Y. Lee, S. Cetinkaya, and W. Jaruphongsa A dynamic model for inventory lot-sizing and outbound shipment scheduling at a third-party warehouse Operations Research 51 2003 735 747
    • (2003) Operations Research , vol.51 , pp. 735-747
    • Lee, C.-Y.1    Cetinkaya, S.2    Jaruphongsa, W.3
  • 9
    • 61349193808 scopus 로고    scopus 로고
    • A constant approximation algorithm for the one-warehouse multi-retailer problem
    • R. Levi, R. Roundy, D. Shmoys, and M. Sviridenko A constant approximation algorithm for the one-warehouse multi-retailer problem Management Science 54 2008 763 776
    • (2008) Management Science , vol.54 , pp. 763-776
    • Levi, R.1    Roundy, R.2    Shmoys, D.3    Sviridenko, M.4
  • 10
    • 0001020790 scopus 로고
    • A facilities in series inventory model with nested schedules
    • S.F. Love A facilities in series inventory model with nested schedules Management Science 18 1972 327 338
    • (1972) Management Science , vol.18 , pp. 327-338
    • Love, S.F.1
  • 11
    • 0023452221 scopus 로고
    • Generating alternative mixed-integer programming models using variable redefinition
    • R.K. Martin Generating alternative mixed-integer programming models using variable redefinition Operations Research 35 1987 331 359
    • (1987) Operations Research , vol.35 , pp. 331-359
    • Martin, R.K.1
  • 14
    • 0028715377 scopus 로고
    • Polyhedra for lot-sizing with WagnerWhitin costs
    • Y. Pochet, and L.A. Wolsey Polyhedra for lot-sizing with WagnerWhitin costs Mathematical Programming 67 1994 297 324
    • (1994) Mathematical Programming , vol.67 , pp. 297-324
    • Pochet, Y.1    Wolsey, L.A.2
  • 15
    • 77955307458 scopus 로고    scopus 로고
    • Private communication
    • D. Stratila, Private communication, 2009.
    • (2009)
    • Stratila, D.1
  • 18
    • 0000495984 scopus 로고
    • Economic lot-sizing: An O (n l o g n) algorithm that runs in linear time in the WagnerWhitin case
    • A.P.M. Wagelmans, C.P.M. van Hoesel, and A.W.J. Kolen Economic lot-sizing: an O (n l o g n) algorithm that runs in linear time in the WagnerWhitin case Operations Research 40 1992 145 156
    • (1992) Operations Research , vol.40 , pp. 145-156
    • Wagelmans, A.P.M.1    Van Hoesel, C.P.M.2    Kolen, A.W.J.3
  • 19
    • 0000631024 scopus 로고
    • A backlogging model and a multi-echelon model of a dynamic economic lot size production system a network approach
    • W.I. Zangwill A backlogging model and a multi-echelon model of a dynamic economic lot size production system a network approach Management Science 15 1969 506 526
    • (1969) Management Science , vol.15 , pp. 506-526
    • Zangwill, W.I.1


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