메뉴 건너뛰기




Volumn 39, Issue 11, 2012, Pages 2776-2786

MIP formulations and heuristics for two-level production-transportation problems

Author keywords

MIP heuristics; Mixed integer programming; Production transportation; Supply chain

Indexed keywords

DISCRETE TIME; DUAL BOUND; EXTENDED FORMULATIONS; GUARANTEED QUALITY; HEURISTIC SOLUTIONS; HYBRID HEURISTICS; LARGE SIZES; MIP HEURISTICS; MIXED-INTEGER PROGRAMMING; MULTI-COMMODITY; MULTIPLE ITEMS; OPTIMIZERS; PRODUCTION SITES; PRODUCTION TRANSPORTATION; RUNTIMES; STRONG FORMULATIONS; VARIABLE FIXING;

EID: 84859717858     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.02.011     Document Type: Article
Times cited : (34)

References (40)
  • 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
    • 0035410522 scopus 로고    scopus 로고
    • Modelling practical lot-sizing problems as mixed-integer programs
    • G. Belvaux, and L.A. Wolsey Modelling practical lot-sizing problems as mixed integer programs Management Science 47 2001 993 1007 (Pubitemid 34192821)
    • (2001) Management Science , vol.47 , Issue.7 , pp. 993-1007
    • Belvaux, G.1    Wolsey, L.A.2
  • 5
    • 52049111930 scopus 로고    scopus 로고
    • A cross entropy-Lagrangean hybrid algorithm for the multi- item capacitated lot-sizing problem with setup times
    • M. Caserta, and E. Quiñonez Rico A cross entropy-Lagrangean hybrid algorithm for the multi- item capacitated lot-sizing problem with setup times Computers and Operations Research 36 2009 530 548
    • (2009) Computers and Operations Research , vol.36 , pp. 530-548
    • Caserta, M.1    Quiñonez Rico, E.2
  • 6
    • 12344255882 scopus 로고    scopus 로고
    • Exploring relaxation induced neighborhoods to improve MIP solutions
    • DOI 10.1007/s10107-004-0518-7
    • E. Danna, E. Rothberg, and C. Le Pape Exploring relaxation induced neighborhoods to improve MIP solutions Mathematical Programming 102 2005 71 90 (Pubitemid 40134692)
    • (2005) Mathematical Programming , vol.102 , Issue.1 , pp. 71-90
    • Danna, E.1    Rothberg, E.2    Pape, C.L.3
  • 8
    • 33845296977 scopus 로고    scopus 로고
    • A Lagrangean heuristic for integrated production and transportation planning problems in a dynamic, multi-item, two-layer supply chain
    • DOI 10.1080/07408170600733244, PII W72215897273GH01
    • S. Eksioglu, B. Eksioglu, and H. Romeijn A lagrangian heuristic for integrated production and transportation planning problems in a dynamic, multi-item, two-layer supply chain IIE Transactions 39 2007 191 201 (Pubitemid 44869872)
    • (2007) IIE Transactions (Institute of Industrial Engineers) , vol.39 , Issue.2 , pp. 191-201
    • Eksioglu, S.D.1    Eksioglu, B.2    Romeijn, H.E.3
  • 9
    • 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 (Pubitemid 18608631)
    • (1987) Operations Research , vol.35 , Issue.6 , pp. 832-848
    • Eppen Gary, D.1    Martin R.Kipp2
  • 10
    • 0004601104 scopus 로고    scopus 로고
    • Time-Partitioning Heuristics: Application to One Warehouse, Multiitem, Multiretailer Lot-Sizing Problems
    • A. Federgruen, and M. Tzur Time-partitioning heuristics: application to one warehouse, multiitem, multiretailer lot-sizing problems Naval Research Logistics 46 5 1999 463 486 (Pubitemid 129584916)
    • (1999) Naval Research Logistics , vol.46 , Issue.5 , pp. 463-486
    • Federgruen, A.1    Tzur, M.2
  • 12
    • 24044549331 scopus 로고    scopus 로고
    • The feasibility pump
    • DOI 10.1007/s10107-004-0570-3
    • M. Fischetti, F. Glover, and A. Lodi The feasibility pump Mathematical Programming 104 2005 91 104 (Pubitemid 41218556)
    • (2005) Mathematical Programming , vol.104 , Issue.1 , pp. 91-104
    • Fischetti, M.1    Glover, F.2    Lodi, A.3
  • 13
    • 84857650419 scopus 로고    scopus 로고
    • On discrete lot-sizing and scheduling on identical parallel machines
    • doi
    • C. Gicquel, L. Wolsey, and M. Minoux On discrete lot-sizing and scheduling on identical parallel machines Optimization Letters 2011, doi: 10.1007/s11590-011-0280-8
    • (2011) Optimization Letters
    • Gicquel, C.1    Wolsey, L.2    Minoux, M.3
  • 14
    • 0035382004 scopus 로고    scopus 로고
    • A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
    • M. Gopalakrishnan, K. Ding, J.M. Bourjolly, and S. Mohan A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover Management Science 47 2001 851 863 (Pubitemid 34192802)
    • (2001) Management Science , vol.47 , Issue.6 , pp. 851-863
    • Gopalakrishnan, M.1    Ding, K.2    Bourjolly, J.-M.3    Mohan, S.4
  • 15
    • 0032093820 scopus 로고    scopus 로고
    • Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
    • E. Katok, H. Lewis, and T. Harrison Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources Management Science 44 6 1998 859 877 (Pubitemid 128572656)
    • (1998) Management Science , vol.44 , Issue.6 , pp. 859-877
    • Katok, E.1    Lewis, H.S.2    Harrison, T.P.3
  • 16
    • 0002180205 scopus 로고
    • Plant location set covering and economic lot sizes: An O(mn) algorithm for structured problems
    • L. Collatz, Birkhauser Verlag Basel
    • J. Krarup, and O. Bilde Plant location set covering and economic lot sizes: an O(mn) 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
  • 17
    • 3042807721 scopus 로고    scopus 로고
    • A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse
    • C.-Y. Lee, S. Çetinkaya, and W. Jaruphongsa A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse Operations Research 51 5 2003 735 747
    • (2003) Operations Research , vol.51 , Issue.5 , pp. 735-747
    • Lee, C.-Y.1    Çetinkaya, S.2    Jaruphongsa, W.3
  • 18
    • 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
  • 20
    • 0012850676 scopus 로고    scopus 로고
    • The uncapacitated lot-sizing problem with sales and safety stocks
    • M. Loparic, Y. Pochet, and L.A. Wolsey The uncapacitated lot-sizing problem with sales and safety stocks Mathematical Programming 89 2001 487 504 (Pubitemid 33758495)
    • (2001) Mathematical Programming, Series B , vol.89 , Issue.3 , pp. 487-504
    • Loparic, M.1    Pochet, Y.2    Wolsey, L.A.3
  • 21
    • 0012850676 scopus 로고    scopus 로고
    • The uncapacitated lot-sizing problem with sales and safety stocks
    • M. Loparic, Y. Pochet, and L.A. Wolsey The uncapacitated lot-sizing problem with sales and safety stocks Mathematical Programming 89 3 2001 487 504 (Pubitemid 33758495)
    • (2001) Mathematical Programming, Series B , vol.89 , Issue.3 , pp. 487-504
    • Loparic, M.1    Pochet, Y.2    Wolsey, L.A.3
  • 22
    • 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 6 1987 820 831 (Pubitemid 18608630)
    • (1987) Operations Research , vol.35 , Issue.6 , pp. 820-831
    • Martin R.Kipp1
  • 25
    • 0028378737 scopus 로고
    • Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering
    • H.H. Millar, and M. Yang Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering International Journal of Production Economics 34 1994 1 15
    • (1994) International Journal of Production Economics , vol.34 , pp. 1-15
    • Millar, H.H.1    Yang, M.2
  • 26
    • 27744470759 scopus 로고    scopus 로고
    • An integrated approach for production and distribution planning in supply chain management
    • DOI 10.1080/00207540412331327718
    • Y.B. Park An integrated approach for production and distribution planning in supply chain management International Journal of Production Research 43 6 2005 1205 1224 (Pubitemid 41633074)
    • (2005) International Journal of Production Research , vol.43 , Issue.6 , pp. 1205-1224
    • Park, Y.B.1
  • 28
    • 4544362972 scopus 로고    scopus 로고
    • A general heuristic for production planning problems
    • DOI 10.1287/ijoc.1030.0042
    • Y. Pochet, and M. Van Vyve A general heuristic for production planning problems INFORMS Journal on Computing 16 2004 316 327 (Pubitemid 39253174)
    • (2004) INFORMS Journal on Computing , vol.16 , Issue.3 , pp. 316-327
    • Pochet, Y.1    Van Vyve, M.2
  • 29
    • 0028715377 scopus 로고
    • Polyhedra for lot-sizing with Wagner-Whitin costs
    • Y. Pochet, and L.A. Wolsey Polyhedra for lot-sizing with Wagner-Whitin costs Mathematical Programming 67 1994 297 324
    • (1994) Mathematical Programming , vol.67 , pp. 297-324
    • Pochet, Y.1    Wolsey, L.A.2
  • 32
    • 44949142877 scopus 로고    scopus 로고
    • Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms
    • P. Robinson, A. Narayanan, and F. Sahin Coordinated deterministic dynamic demand lot-sizing problem: a review of models and algorithms Omega 37 2009 3 15
    • (2009) Omega , vol.37 , pp. 3-15
    • Robinson, P.1    Narayanan, A.2    Sahin, F.3
  • 33
    • 4744372709 scopus 로고    scopus 로고
    • A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
    • M. Sambasivan, and S. Yahya A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers Computers and Operations Research 32 3 2005 537 555
    • (2005) Computers and Operations Research , vol.32 , Issue.3 , pp. 537-555
    • Sambasivan, M.1    Yahya, S.2
  • 35
    • 84863209623 scopus 로고    scopus 로고
    • The one-warehouse multi-retailer problem: Reformulation, classification, and computational results
    • to appear, doi: 10.1007/s10479-011-1022-0
    • Solyali O, Sural H. The one-warehouse multi-retailer problem: reformulation, classification, and computational results. Annals of Operations Research, to appear, doi: 10.1007/s10479-011-1022-0.
    • Annals of Operations Research
    • Solyali, O.1    Sural, H.2
  • 36
    • 0141733592 scopus 로고    scopus 로고
    • Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows
    • H. Stadtler Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows Operations Research 51 2003 487 502
    • (2003) Operations Research , vol.51 , pp. 487-502
    • Stadtler, H.1
  • 38
    • 27744547914 scopus 로고    scopus 로고
    • Integrated lot sizing in serial supply chains with production capacities
    • DOI 10.1287/mnsc.1050.0378
    • S. van Hoesel, H.E. Romeijn, D. Romero Morales, and A.P.M. Wagelmans Integrated lot sizing in serial supply chains with production capacities Management Science 51 2005 1706 1719 (Pubitemid 41618470)
    • (2005) Management Science , vol.51 , Issue.11 , pp. 1706-1719
    • Van Hoesel, S.1    Romeijn, H.E.2    Morales, D.R.3    Wagelmans, A.P.M.4
  • 39
    • 29044444265 scopus 로고    scopus 로고
    • Approximate extended formulations
    • DOI 10.1007/s10107-005-0663-7
    • M. Van Vyve, and L.A. Wolsey Approximate extended formulations Mathematical Programming B 105 2006 501 522 (Pubitemid 41788331)
    • (2006) Mathematical Programming , vol.105 , Issue.2-3 , pp. 501-522
    • Van Vyve, M.1    Wolsey, L.A.2
  • 40
    • 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가 분석하여 추출한 것입니다.