메뉴 건너뛰기




Volumn 230, Issue 2, 2013, Pages 399-411

Pricing, relaxing and fixing under lot sizing and scheduling

Author keywords

Lot sizing and scheduling Sequence dependent setups Non triangular setups Column generation MIP based heuristics

Indexed keywords

CAPACITATED LOT SIZING; COMPUTATIONAL STUDIES; LOT SIZING PROBLEMS; LOT-SIZING AND SCHEDULING; NEIGHBORHOOD STRUCTURE; PRODUCTION SEQUENCES; SEQUENCE DEPENDENT SETUPS; SEQUENCE-DEPENDENT SETUP TIME;

EID: 84878942137     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.04.030     Document Type: Article
Times cited : (31)

References (29)
  • 2
    • 78349255856 scopus 로고    scopus 로고
    • Searchcol: Metaheuristic search by column generation
    • M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels, Lecture Notes in Computer Science Springer Berlin/Heidelberg
    • F. Alvelos, A. de Sousa, and D. Santos Searchcol: metaheuristic search by column generation M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels, Hybrid Metaheuristics Lecture Notes in Computer Science vol. 6373 2010 Springer Berlin/Heidelberg 190 205
    • (2010) Hybrid Metaheuristics , vol.6373 , pp. 190-205
    • Alvelos, F.1    De Sousa, A.2    Santos, D.3
  • 3
    • 0004000855 scopus 로고
    • Tech. Rep., Chesapeake Decision Sciences, Inc.
    • Baker, T., Muckstadt, J., 1989. The CHES Problems. Tech. Rep., Chesapeake Decision Sciences, Inc.
    • (1989) The CHES Problems
    • Baker, T.1    Muckstadt, J.2
  • 4
    • 84987028582 scopus 로고
    • The prize collecting traveling salesman problem
    • E. Balas The prize collecting traveling salesman problem Networks 19 6 1989 621 636
    • (1989) Networks , vol.19 , Issue.6 , pp. 621-636
    • Balas, E.1
  • 7
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • G. Bitran, and H. Yanasse Computational complexity of the capacitated lot size problem Management Science 28 10 1992 1174 1186
    • (1992) Management Science , vol.28 , Issue.10 , pp. 1174-1186
    • Bitran, G.1    Yanasse, H.2
  • 8
    • 79956127340 scopus 로고    scopus 로고
    • Hybrid metaheuristics in combinatorial optimization: A survey
    • C. Blum, J. Puchinger, G.R. Raidl, and A. Roli Hybrid metaheuristics in combinatorial optimization: a survey Applied Soft Computing 11 6 2011 4135 4151
    • (2011) Applied Soft Computing , vol.11 , Issue.6 , pp. 4135-4151
    • Blum, C.1    Puchinger, J.2    Raidl, G.R.3    Roli, A.4
  • 10
  • 11
    • 38549131391 scopus 로고    scopus 로고
    • Progressive interval heuristics for multi-item capacitated lot-sizing problems
    • A. Federgruen, J. Meissner, and M. Tzur Progressive interval heuristics for multi-item capacitated lot-sizing problems Operations Research 55 3 2007 490 502
    • (2007) Operations Research , vol.55 , Issue.3 , pp. 490-502
    • Federgruen, A.1    Meissner, J.2    Tzur, M.3
  • 12
    • 58149250389 scopus 로고    scopus 로고
    • Solution approaches for the soft drink integrated production lot sizing and scheduling problem
    • D. Ferreira, R. Morabito, and S. Rangel Solution approaches for the soft drink integrated production lot sizing and scheduling problem European Journal of Operational Research 196 2 2009 697 706
    • (2009) European Journal of Operational Research , vol.196 , Issue.2 , pp. 697-706
    • Ferreira, D.1    Morabito, R.2    Rangel, S.3
  • 13
    • 0008655177 scopus 로고    scopus 로고
    • The general lotsizing and scheduling problem
    • B. Fleischmann, and H. Meyr The general lotsizing and scheduling problem OR Spektrum 19 1 1997 11 21
    • (1997) OR Spektrum , vol.19 , Issue.1 , pp. 11-21
    • Fleischmann, B.1    Meyr, H.2
  • 14
    • 0033690423 scopus 로고    scopus 로고
    • Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities
    • K. Haase, and A. Kimms Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities International Journal of Production Economics 66 2 2000 159 169
    • (2000) International Journal of Production Economics , vol.66 , Issue.2 , pp. 159-169
    • Haase, K.1    Kimms, A.2
  • 15
    • 79955056703 scopus 로고    scopus 로고
    • Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics
    • R.J. James, and B. Almada-Lobo Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics Computers and Operations Research 38 12 2011 1816 1825
    • (2011) Computers and Operations Research , vol.38 , Issue.12 , pp. 1816-1825
    • James, R.J.1    Almada-Lobo, B.2
  • 17
    • 0032652235 scopus 로고    scopus 로고
    • Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
    • S. Kang, K. Malik, and L.J. Thomas Lotsizing and scheduling on parallel machines with sequence-dependent setup costs Management Science 45 2 1999 273 289
    • (1999) Management Science , vol.45 , Issue.2 , pp. 273-289
    • Kang, S.1    Malik, K.2    Thomas, L.J.3
  • 18
    • 61449139202 scopus 로고    scopus 로고
    • An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups
    • A. Kovács, K.N. Brown, and S.A. Tarim An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups International Journal of Production Economics 118 1 2009 282 291
    • (2009) International Journal of Production Economics , vol.118 , Issue.1 , pp. 282-291
    • Kovács, A.1    Brown, K.N.2    Tarim, S.A.3
  • 19
    • 0002180205 scopus 로고
    • Plant location, set covering and economic lot size: An O(mn) algorithm for structured problems
    • Birkhauser Verlag Berlin
    • J. Krarup, and O. Bilde Plant location, set covering and economic lot size: An O(mn) algorithm for structured problems Optimierung bei Graphentheoretischen und Ganzzahligen Probleme 1977 Birkhauser Verlag Berlin 155 180
    • (1977) Optimierung Bei Graphentheoretischen und Ganzzahligen Probleme , pp. 155-180
    • Krarup, J.1    Bilde, O.2
  • 21
    • 79958772189 scopus 로고    scopus 로고
    • Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
    • A. Menezes, A. Clark, and B. Almada-Lobo Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups Journal of Scheduling 14 2 2011 209 219
    • (2011) Journal of Scheduling , vol.14 , Issue.2 , pp. 209-219
    • Menezes, A.1    Clark, A.2    Almada-Lobo, B.3
  • 22
    • 0033903519 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
    • H. Meyr Simultaneous lotsizing and scheduling by combining local search with dual reoptimization European Journal of Operational Research 120 2 2000 311 326
    • (2000) European Journal of Operational Research , vol.120 , Issue.2 , pp. 311-326
    • Meyr, H.1
  • 23
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling on parallel machines
    • H. Meyr Simultaneous lotsizing and scheduling on parallel machines European Journal of Operational Research 139 2 2002 277 292
    • (2002) European Journal of Operational Research , vol.139 , Issue.2 , pp. 277-292
    • Meyr, H.1
  • 24
    • 78649362514 scopus 로고    scopus 로고
    • Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
    • I. Muter, Ş.İ. Birbil, and G. Şahin Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems INFORMS Journal on Computing 22 4 2010 603 619
    • (2010) INFORMS Journal on Computing , vol.22 , Issue.4 , pp. 603-619
    • Muter, I.1    Birbil, S.I.2    Şahin, G.3
  • 26
    • 60349090312 scopus 로고    scopus 로고
    • Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
    • F. Sahling, L. Buschkühl, H. Tempelmeier, and S. Helber Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic Computers and Operations Research 36 9 2009 2546 2553
    • (2009) Computers and Operations Research , vol.36 , Issue.9 , pp. 2546-2553
    • Sahling, F.1    Buschkühl, L.2    Tempelmeier, H.3    Helber, S.4
  • 27
    • 79952898545 scopus 로고    scopus 로고
    • New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
    • S. Sarin, H. Sherali, and L. Yao New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem Optimization Letters 5 2 2011 259 272
    • (2011) Optimization Letters , vol.5 , Issue.2 , pp. 259-272
    • Sarin, S.1    Sherali, H.2    Yao, L.3
  • 28
    • 0036968625 scopus 로고    scopus 로고
    • Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
    • L.A. Wolsey Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation Management Science 48 12 2002 1587 1602
    • (2002) Management Science , vol.48 , Issue.12 , pp. 1587-1602
    • Wolsey, L.A.1
  • 29
    • 33748492325 scopus 로고    scopus 로고
    • Scheduling and lot sizing with sequence-dependent setup: A literature review
    • X. Zhu, and W.E. Wilhelm Scheduling and lot sizing with sequence-dependent setup: a literature review IIE Transactions 38 11 2006 987 1007
    • (2006) IIE Transactions , vol.38 , Issue.11 , pp. 987-1007
    • Zhu, X.1    Wilhelm, W.E.2


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