연구동향 분석

Integer Optimization and Approximate Dynamic Programming Approaches for Lot-sizing and Scheduling Problem with Sequence-dependent Setups = 순서의존적 작업준비가 있는 생산계획 문제에 대한 정수 최적화 및 근사 동적 계획법 기반 해법

이연수 2022년

논문상세정보
인용/피인용
' Integer Optimization and Approximate Dynamic Programming Approaches for Lot-sizing and Scheduling Problem with Sequence-dependent Setups = 순서의존적 작업준비가 있는 생산계획 문제에 대한 정수 최적화 및 근사 동적 계획법 기반 해법' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 제조공업
  • Approximate dynamic programming
  • Extended formulation
  • Integer optimization
  • Lot-sizing and scheduling problem
  • Sequence-dependent setup
  • Valid inequality
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
125 0

0.0%

' Integer Optimization and Approximate Dynamic Programming Approaches for Lot-sizing and Scheduling Problem with Sequence-dependent Setups = 순서의존적 작업준비가 있는 생산계획 문제에 대한 정수 최적화 및 근사 동적 계획법 기반 해법' 의 참고문헌

  • \Plant location , set covering and economic lot size : An O ( mn ) -algorithm for structured problems
  • \Lot-sizing and scheduling in at-panel display manufacturing process
    Lee , Younsoo & Kyungsik Lee 93 , p. 102036 . [2020]
  • \Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings
  • \An analysis of formulations for the capacitated lot sizing problem with setup crossover
  • \A hybrid Lagrangian-simulated annealing-based heuristic for the parallelmachine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
  • Zhu, Xiaoyan & Wilbert E. Wilhelm (2006). \Scheduling and lot sizing with sequencedependent setup: A literature review". IIE Transactions 38.11, pp. 987{1007.
    [2006]
  • Zangwill, Willard I (1966). \A deterministic multi-period production scheduling model with backlogging". Management Science 13.1, pp. 105{119.
    [1966]
  • Wolsey, Laurence A. (1997). \MIP modelling of changeovers in production planning and scheduling problems". European Journal of Operational Research 99.1, pp. 154{165.
    [1997]
  • Wolsey, Laurence A (2020). Integer programming. John Wiley & Sons.
    [2020]
  • Wolsey, Laurence A (1989). \Uncapacitated lot-sizing problems with start-up costs". Operations Research 37.5, pp. 741{747.
    [1989]
  • Wagner, Harvey M & Thomson M Whitin (1958). \Dynamic version of the economic lot size model". Management science 5.1, pp. 89{96.
    [1958]
  • Wagelmans, Albert, Stan Van Hoesel & Antoon Kolen (1992). \Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case". Operations Research 40.1-supplement-1, S145{S156.
    [1992]
  • Van Vyve, Mathieu (2007). \Algorithms for single-item lot-sizing problems with constant batch size". Mathematics of Operations Research 32.3, pp. 594{613.
    [2007]
  • Van Hoesel, CPM & Albert Peter MarieWagelmans (1996). \An O(T3) algorithm for the economic lot-sizing problem with constant capacities". Management science 42.1, pp. 142{150.
    [1996]
  • Trigeiro, William W, L Joseph Thomas & John O McClain (1989). \Capacitated lot sizing with setup times". Management science 35.3, pp. 353{366.
    [1989]
  • Toth, Paolo & Daniele Vigo (2002). The vehicle routing problem. SIAM.
    [2002]
  • Toscano, Alyne, Deisemara Ferreira & Reinaldo Morabito (2019). \A decomposition heuristic to solve the two-stage lot sizing and scheduling problem with temporal cleaning". Flexible Services and Manufacturing Journal 31.1, pp. 142{173.
    [2019]
  • Toriello, Alejandro, George Nemhauser & Martin Savelsbergh (2010). \Decomposing inventory routing problems with approximate value functions". Naval Research Logistics 57.8, pp. 718{727.
    [2010]
  • Topaloglu, Huseyin & Warren B Powell (2006). \Dynamic-programming approximations for stochastic time-staged integer multicommodity- ow problems". IN- FORMS Journal on Computing 18.1, pp. 31{42.
    [2006]
  • Sung, Charles & Christos T Maravelias (2008). \A mixed-integer programming formulation for the general capacitated lot-sizing problem". Computers & Chemical Engineering 32.1-2, pp. 244{259.
    [2008]
  • Suerie, Christopher (2006). \Modeling of period overlapping setup times". European Journal of Operational Research 174.2, pp. 874{886.
    [2006]
  • Suerie, Christopher & Hartmut Stadtler (2003). \The capacitated lot-sizing problem with linked lot sizes". Management Science 49.8, pp. 1039{1054.
    [2003]
  • Stadtler, Hartmut, Christoph Kilger & Herbert Meyr (2015). Supply chain man- agement and advanced planning: concepts, models, software, and case studies. Springer.
    [2015]
  • Sarin, Subhash C, Hanif D Sherali & Liming Yao (2011). \New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem". Optimization Letters 5.2, pp. 259{272.
    [2011]
  • Salomon, Marc, MariusMSolomon, Luk N VanWassenhove, Yvan Dumas & Stephane Dauz?ere-P?er?es (1997). \Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows". European Journal of Operational Research 100.3, pp. 494{513.
  • Rogers, Jack (1958). \A computational approach to the economic lot scheduling problem". Management science 4.3, pp. 264{291.
    [1958]
  • R?os-Sol?s, Yasm?n ?A, Omar J Ibarra-Rojas, Marta Cabo & Edgar Possani (2020). \A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production". European Journal of Operational Research 284.3, pp. 861{873.
  • Puterman, Martin L (2014). Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons.
    [2014]
  • Powell, Warren B (2019). \A uni?ed framework for stochastic optimization". Euro- pean Journal of Operational Research 275.3, pp. 795{821.
  • Powell, Warren B (2016). \Perspectives of approximate dynamic programming". Annals of Oper- ations Research 241.1-2, pp. 319{356.
    [2016]
  • Powell, Warren B (2007). Approximate dynamic programming: Solving the curses of dimensionality. John Wiley & Sons.
    [2007]
  • Potts, Chris N & Luk N Van Wassenhove (1992). \Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity". Journal of the Operational Research Society 43.5, pp. 395{406.
    [1992]
  • Pochet, Yves & Laurence A Wolsey (2006). Production planning by mixed integer programming. Springer Science & Business Media.
    [2006]
  • Pochet, Yves & Laurence A Wolsey (1994). \Polyhedra for lot-sizing with Wagner| Whitin costs". Mathematical Programming 67.1, pp. 297{323.
    [1994]
  • Pinedo, Michael L (2012). Scheduling. Vol. 29. Springer.
    [2012]
  • Papageorgiou, Dimitri J, Myun-Seok Cheon, George Nemhauser & Joel Sokol (2015). \Approximate dynamic programming for a class of long-horizon maritime inventory routing problems". Transportation Science 49.4, pp. 870{885.
    [2015]
  • Padberg, Manfred & Ting-Yi Sung (1991). \An analytical comparison of di?erent formulations of the travelling salesman problem". Mathematical Programming 52.1, pp. 315{357.
  • Oyebolu, Folarin B, Jeroen van Lidth de Jeude, Cyrus Siganporia, Suzanne S Farid, Richard Allmendinger & Juergen Branke (2017). \A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production". Journal of Heuristics 23.4, pp. 231{256.
    [2017]
  • Nemhauser, George & Laurence Wolsey (1988). Integer and Combinatorial Opti- mization. John Wiley & Sons, Ltd. Chap. III.1, pp. 533{607.
    [1988]
  • Mohan, Srimathy, Mohan Gopalakrishnan, Rahul Marathe & Ashwin Rajan (2012). \A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting". International Journal of Production Research 50.19, pp. 5538{5543.
    [2012]
  • Miller, Clair E, Albert W Tucker & Richard A Zemlin (1960). \Integer programming formulation of traveling salesman problems". Journal of the ACM (JACM) 7.4, pp. 326{329.
    [1960]
  • Miller, Andrew J, George L Nemhauser & Martin WP Savelsbergh (2003b). \On the polyhedral structure of a multi{item production planning model with setup times". Mathematical Programming 94.2, pp. 375{405.
  • Miller, Andrew J, George L Nemhauser & Martin WP Savelsbergh (2003a). \A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case". Mathematical pro- gramming 95.1, pp. 71{90.
  • Meyr, Herbert (2002). \Simultaneous lotsizing and scheduling on parallel machines". European Journal of Operational Research 139.2, pp. 277{292.
    [2002]
  • Meyr, Herbert (2000). \Simultaneous lotsizing and scheduling by combining local search with dual reoptimization". European Journal of Operational Research 120.2, pp. 311{326.
    [2000]
  • Meyr, Herbert & Matthias Mann (2013). \A decomposition approach for the general lotsizing and scheduling problem for parallel production lines". European Journal of Operational Research 229.3, pp. 718{731.
    [2013]
  • Menezes, Ant?onio Aroso, Alistair Clark & Bernardo Almada-Lobo (2011). \Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups". Journal of Scheduling 14.2, pp. 209{219.
  • Melega, Gislaine Mara, Silvio Alexandre de Araujo & Reinaldo Morabito (2020). \Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems". Annals of Operations Research 295.2, pp. 695{ 736.
    [2020]
  • Maravelias, Christos T & Charles Sung (2009). \Integration of production planning and scheduling: Overview, challenges and opportunities". Computers & Chemical Engineering 33.12, pp. 1919{1930.
    [2009]
  • Manne, Alan S (1958). \Programming of economic lot sizes". Management science 4.2, pp. 115{135.
    [1958]
  • Mahdieh, Masoumeh, Alistair Clark & Mehdi Bijari (2018). \A novel exible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in di?erent machine con?gurations". Flexible Services and Manufac- turing Journal 30.4, pp. 884{923.
  • Maes, Johan, John O. McClain & Luk N. Van Wassenhove (1991). \Multilevel capacitated lotsizing complexity and LP-based heuristics". European Journal of Operational Research 53.2, pp. 131{148.
    [1991]
  • Leung, Janny MY, Thomas L Magnanti & Rita Vachani (1989). \Facets and algorithms for capacitated lot sizing". Mathematical programming 45.1, pp. 331{ 359.
    [1989]
  • Letchford, Adam N. & Juan Jos?e Salazar-Gonz?alez (2015). \Stronger multi-commodity ow formulations of the Capacitated Vehicle Routing Problem". European Journal of Operational Research 244.3, pp. 730{ 738.
  • Letchford, Adam N. & Juan Jos?e Salazar-Gonz?alez (2006). \Projection results for vehicle routing". Mathematical Programming 105.2-3, pp. 251{274.
  • Letchford, Adam N, Richard W Eglese & Jens Lysgaard (2002). \Multistars, partial multistars and the capacitated vehicle routing problem". Mathematical Program- ming 94.1, pp. 21{40.
    [2002]
  • Lasserre, Jean-Bernard (1992). \An integrated model for job-shop planning and scheduling". Management Science 38.8, pp. 1201{1211.
    [1992]
  • Larroche, Fran?cois, Odile Bellenguez & Guillaume Massonnet (2021). \Clusteringbased solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups". International Journal of Production Research, pp. 1{24.
  • Ku?cukyavuz, Simge & Yves Pochet (2009). \Uncapacitated lot sizing with backlogging: The convex hull". Mathematical Programming 118.1, pp. 151{175.
  • Koch, Cyril, Taha Arbaoui, Yassine Ouazene, Farouk Yalaoui, Humbert De Brunier, Nicolas Jaunet & Antoine DeWulf (2022). \A Matheuristic Approach for Solving a Simultaneous Lot Sizing and Scheduling Problem with Client Prioritization in Tire Industry". Computers & Industrial Engineering, p. 107932.
  • Ko?clar, Ay?se & Haldun Sural (2005). \A note on \The general lot sizing and scheduling problem"". OR Spectrum 27.1, pp. 145{146.
  • Karmarkar, Uday S & Linus Schrage (1985). \The deterministic dynamic product cycling problem". Operations Research 33.2, pp. 326{345.
    [1985]
  • James, Ross JW & Bernardo Almada-Lobo (2011). \Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics". Computers & Operations Research 38.12, pp. 1816{1825.
    [2011]
  • Ho?man, Alan J (1976). \Total unimodularity and combinatorial theorems". Linear Algebra and its Applications 13.1-2, pp. 103{108.
  • Hartman, Joseph C, I Esra Buyuktahtakin & J Cole Smith (2010). \Dynamicprogramming- based inequalities for the capacitated lot-sizing problem". IIE Transactions 42.12, pp. 915{930.
  • Harris, Ford W (1913). \How many parts to make at once". Operations Research 38.6, pp. 947{950.
    [1913]
  • Haase, Knut (1996). \Capacitated lot-sizing with sequence dependent setup costs". Operations-Research-Spektrum 18.1, pp. 51{59.
    [1996]
  • Haase, Knut & Alf Kimms (2000). \Lot sizing and scheduling with sequencedependent setup costs and times and e?cient rescheduling opportunities". In- ternational Journal of Production Economics 66.2, pp. 159{169.
  • Gupta, Diwakar & Thorkell Magnusson (2005). \The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times". Com- puters and Operations Research 32.4, pp. 727{747.
    [2005]
  • Guimar~aes, Luis, Diego Klabjan & Bernardo Almada-Lobo (2014). \Modeling lotsizing and scheduling problems with sequence dependent setups". European Journal of Operational Research 239.3, pp. 644{662.
    [2014]
  • Guimar~aes, Luis, Diego Klabjan & Bernardo Almada-Lobo (2013). \Pricing, relaxing and xing under lot sizing and scheduling". European Journal of Operational Research 230.2, pp. 399{411.
    [2013]
  • Gouveia, Luis (1995). \A result on projection for the vehicle routing problem". European Journal of Operational Research 85.3, pp. 610{624.
    [1995]
  • Gicquel, C?eline, Abdel Lisser & Michel Minoux (2014). \An evaluation of semide?- nite programming based approaches for discrete lot-sizing problems". European Journal of Operational Research 237.2, pp. 498{507.
  • Gicquel, C?eline & Michel Minoux (2015). \Multi-product valid inequalities for the discrete lot-sizing and scheduling problem". Computers & Operations Research 54, pp. 12{20.
  • Gavish, Bezalel & Stephen C Graves (1978). \The travelling salesman problem and related problems".
    [1978]
  • Florian, Michael, Jan Karel Lenstra & AHG Rinnooy Kan (1980). \Deterministic production planning: Algorithms and complexity". Management science 26.7, pp. 669{679.
    [1980]
  • Fleischmann, Bernhard (1994). \The discrete lot-sizing and scheduling problem with sequence-dependent setup costs". European Journal of Operational Research 75.2, pp. 395{404.
    [1994]
  • Fleischmann, Bernhard & Herbert Meyr (1997). \The general lotsizing and scheduling problem". Operations-Research-Spektrum 19.1, pp. 11{21.
    [1997]
  • Fiorotto, Diego Jacinto, Jackeline del Carmen Huaccha Neyra & Silvio Alexandre de Araujo (2020). \Impact analysis of setup carryover and crossover on lot sizing problems". International Journal of Production Research 58.20, pp. 6350{6369.
    [2020]
  • Ferreira, Deisemara, Reinaldo Morabito & Socorro Rangel (2010). \Relax and x heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants". Computers & Operations Research 37.4, pp. 684{691.
    [2010]
  • Federgruen, Awi & Michal 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". Manage- ment Science 37.8, pp. 909{925.
    [1991]
  • Eppen, Gary D & R Kipp Martin (1987). \Solving multi-item capacitated lot-sizing problems using variable rede?nition". Operations Research 35.6, pp. 832{848.
  • Drexl, Andreas & Knut Haase (1995). \Proportional lotsizing and scheduling". International Journal of Production Economics 40.1, pp. 73{87.
    [1995]
  • Drexl, Andreas & Alf Kimms (1997). \Lot sizing and scheduling|survey and extensions". European Journal of operational research 99.2, pp. 221{235.
    [1997]
  • Doostmohammadi, Mahdi & Kerem Akartunal? (2018). \Valid inequalities for twoperiod relaxations of big-bucket lot-sizing problems: Zero setup case". European Journal of Operational Research 267.1, pp. 86{95.
  • Desaulniers, Guy, Jacques Desrosiers & Marius M Solomon (2006). Column gener- ation. Vol. 5. Springer Science & Business Media.
    [2006]
  • Denizel, Meltem & Haldun Sural (2006). \On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times". Journal of the Operational Research Society 57.4, pp. 389{399.
  • Dauzere-Peres, Stephane & Jean-Bernard Lasserre (1994). \Integration of lotsizing and scheduling decisions in a job-shop". European Journal of Operational Research 75.2, pp. 413{426.
    [1994]
  • Cunha, Jesus O & Rafael A Melo (2021). \Valid inequalities, preprocessing, and an e?ective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure". European Journal of Operational Research 295.3, pp. 874{892.
  • Copil, Karina, Martin Worbelauer, Herbert Meyr & Horst Tempelmeier (2017). \Simultaneous lotsizing and scheduling problems: a classi?cation and review of models". OR Spectrum 39.1, pp. 1{64.
  • Constantino, Miguel (1996). \A cutting plane approach to capacitated lot-sizing with start-up costs". Mathematical Programming 75.3, pp. 353{376.
    [1996]
  • Clark, Alistair, Masoumeh Mahdieh & Socorro Rangel (2014). \Production lot sizing and scheduling with non-triangular sequence-dependent setup times". Interna- tional Journal of Production Research 52.8, pp. 2490{2503.
    [2014]
  • Claassen, GDH, Johanna C Gerdessen, Eligius MT Hendrix & Jack GAJ van der Vorst (2016). \On production planning and scheduling in food processing industry: Modelling non-triangular setups andproduct decay". Computers & Opera- tions Research 76, pp. 147{154.
    [2016]
  • Christopher, Martin (2016). Logistics & supply chain management. Pearson UK.
    [2016]
  • Chiang, Tsung-Che & Li-Chen Fu (2009). \Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times". European Journal of Operational Research 196.1, pp. 78{ 92.
    [2009]
  • Chen, W-H & J-M Thizy (1990). \Analysis of relaxations for the multi-item capacitated lot-sizing problem". Annals of operations Research 26.1, pp. 29{72.
    [1990]
  • Cervantes-Sanmiguel, KI, MJ Vargas-Flores & OJ Ibarra-Rojas (2021). \A twostage sequential approach for scheduling with lot-sizing decisions in the context of plastic injection systems". Computers & Industrial Engineering 151, p. 106969.
  • Carvalho, Desiree M & Mari?a CV Nascimento (2022). \Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup". European Journal of Operational Research 296.1, pp. 158{173.
  • Camargo, V. C B, F. M B Toledo & B. Almada-Lobo (2012). \Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries". Journal of the Operational Research Society 63.11, pp. 1613{1630.
    [2012]
  • Buyuktahtak?n, _I Esra & Ning Liu (2016). \Dynamic programming approximation algorithms for the capacitated lot-sizing problem". Journal of Global Optimiza- tion 65.2, pp. 231{259.
  • Buyuktahtak?n, I Esra, J Cole Smith & Joseph C Hartman (2018). \Partial objective inequalities for the multi-item capacitated lot-sizing problem". Computers & Operations Research 91, pp. 132{144.
  • Bitran, Gabriel R & Horacio H Yanasse (1982). \Computational complexity of the capacitated lot size problem". Management Science 28.10, pp. 1174{1186.
    [1982]
  • Bertsimas, Dimitris & Ramazan Demir (2002). \An approximate dynamic programming approach to multidimensional knapsack problems". Management Science 48.4, pp. 550{565.
    [2002]
  • Bertsekas, Dimitri (2012). Dynamic programming and optimal control: Volume I. Vol. 1. Athena scienti?c.
  • Belo-Filho, M?arcio A F, Franklina M B Toledo & Bernardo Almada-Lobo (2014). \Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover". Journal of the Operational Research Society 65.11, pp. 1735{1747.
  • Bellman, R.E. (1957). Dynamic Programming. Rand Corporation research study. Princeton University Press.
    [1957]
  • Barany, Imre, Tony J Van Roy & Laurence A Wolsey (1984). \Strong formulations for multi-item capacitated lot sizing". Management Science 30.10, pp. 1255{ 1261.
    [1984]
  • Avella, Pasquale, Maurizio Boccia & Laurence A Wolsey (2018). \Single-period cutting planes for inventory routing problems". Transportation Science 52.3, pp. 497{508.
    [2018]
  • Alves, Fernanda F, Thiago H Nogueira, Mauricio C de Souza & Mart?n G Ravetti (2021). \Approaches for the joint resolution of lot-sizing and scheduling with infeasibilities occurrences". Computers & Industrial Engineering 155, p. 107176.
  • Almeder, Christian & Bernardo Almada-Lobo (2011). \Synchronisation of scarce resources for a parallel machine lotsizing problem". International Journal of Production Research 49.24, pp. 7315{7335.
    [2011]
  • Almada-Lobo, Bernardo, Diego Klabjan, Maria Ant?onia Carravilla & Jos?e F. Oliveira (2007). \Single machine multi-product capacitated lot sizing with sequencedependent setups". International Journal of Production Research 45.20, pp. 4873{ 4894.
  • Almada-Lobo, Bernardo, Alistair Clark, Lu?s Guimar~aes, Gon?calo Figueira & Pedro Amorim (2015). \Industrial insights into lot sizing and scheduling modeling". Pesquisa Operacional 35.3, pp. 439{464.
  • Alipour, Zohreh, Fariborz Jolai, Ehsan Monabbati & Nima Zaerpour (2020). \General lot-sizing and scheduling for perishable food products". RAIRO - Operations Research 54.3, pp. 913{931.
    [2020]
  • Alem, Douglas, Eduardo Curcio, Pedro Amorim & Bernardo Almada-Lobo (2018). \A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches". Computers & Oper- ations Research 90, pp. 125{141.
    [2018]
  • Al?eri, A., P. Brandimarte & S. D'Orazio (2002). \LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm". International Journal of Production Research 40.2, pp. 441{458.
  • Akartunal?, Kerem, Ioannis Fragkos, Andrew J. Miller & Tao Wu (2016). \Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems". INFORMS Journal on Computing 28.4, pp. 766{780.
  • Aggarwal, Alok & James K Park (1993). \Improved algorithms for economic lot size problems". Operations research 41.3, pp. 549{571.
    [1993]