Ver registro no DEDALUS
Exportar registro bibliográfico

Metrics


Metrics:

A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (2015)

  • Authors:
  • USP affiliated authors: TOLEDO, CLÁUDIO FABIANO MOTTA - ICMC
  • USP Schools: ICMC
  • DOI: 10.1007/s10732-015-9295-0
  • Subjects: SISTEMAS EMBUTIDOS; COMPUTAÇÃO EVOLUTIVA; ROBÓTICA
  • Keywords: Lot-sizing; Heuristics; Relax-and-fix; Fix-and-optimize; Backlogging
  • Language: Inglês
  • Imprenta:
  • Source:
  • Acesso online ao documento

    Online accessDOI or search this record in
    Informações sobre o DOI: 10.1007/s10732-015-9295-0 (Fonte: oaDOI API)
    • Este periódico é de assinatura
    • Este artigo é de acesso aberto
    • URL de acesso aberto
    • Cor do Acesso Aberto: green
    Versões disponíveis em Acesso Aberto do: 10.1007/s10732-015-9295-0 (Fonte: Unpaywall API)

    Título do periódico: Journal of Heuristics

    ISSN: 1381-1231,1572-9397



      Não possui versão em Acesso aberto
    Informações sobre o Citescore
  • Título: Journal of Heuristics

    ISSN: 1381-1231

    Citescore - 2017: 1.95

    SJR - 2017: 1.008

    SNIP - 2017: 1.324


  • Exemplares físicos disponíveis nas Bibliotecas da USP
    BibliotecaCód. de barrasNúm. de chamada
    ICMC2804143-10PROD 2804143
    How to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      TOLEDO, Claudio Fabiano Motta; ARANTES, Márcio da Silva; HOSSOMI, Marcelo Yukio Bressan; FRANÇA, Paulo Morelato; AKARTUNALI, Kerem. A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. Journal of Heuristics, Dordrecht, Springer, v. 21, n. 5, p. 687-717, 2015. Disponível em: < http://dx.doi.org/10.1007/s10732-015-9295-0 > DOI: 10.1007/s10732-015-9295-0.
    • APA

      Toledo, C. F. M., Arantes, M. da S., Hossomi, M. Y. B., França, P. M., & Akartunalı, K. (2015). A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. Journal of Heuristics, 21( 5), 687-717. doi:10.1007/s10732-015-9295-0
    • NLM

      Toledo CFM, Arantes M da S, Hossomi MYB, França PM, Akartunalı K. A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems [Internet]. Journal of Heuristics. 2015 ; 21( 5): 687-717.Available from: http://dx.doi.org/10.1007/s10732-015-9295-0
    • Vancouver

      Toledo CFM, Arantes M da S, Hossomi MYB, França PM, Akartunalı K. A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems [Internet]. Journal of Heuristics. 2015 ; 21( 5): 687-717.Available from: http://dx.doi.org/10.1007/s10732-015-9295-0

    Referências citadas na obra
    Absi, N., Detienne, B., Dauzère-Pérès, S.: Heuristics for the multi-item capacitated lot-sizing problem with lost sales. Comput. Oper. Res. 40(1), 264–272 (2013)
    Akartunalı, K., Miller, A.J.: A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193(2), 396–411 (2009)
    Akartunalı, K., Miller, A.J.: A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3), 729–753 (2012)
    Almada-Lobo, B., Klabjan, D., Carravilla, M.A., Oliveira, J.F.: Multiple machine continuous setup lotsizing with sequence-dependent setups. Comput. Optim. Appl. 47(3), 529–552 (2010)
    Almeder, C.: A hybrid optimization approach for multi-level capacitated lot-sizing problems. Eur. J. Oper. Res. 200, 599–606 (2010)
    Baki, M.F., Chaouch, B.A., Abdul-Kader, W.: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery. Comput. Oper. Res. 43, 225–236 (2014)
    Ball, M.O.: Heuristics based on mathematical programming. Surv. Oper. Res. Manage. Sci. 16(1), 21–38 (2011)
    Barany, I., van Roy, T.J., Wolsey, L.A.: Uncapacitated lot sizing: the convex hull of solutions. Math. Program Study 22, 32–43 (1984)
    Belvaux, G., Wolsey, L.A.: bc-prod: a specialized branch-and-cut system for lot-sizing problems. Manage. Sci. 46(5), 724–738 (2000)
    Billington, P.J., McClain, J.O., Thomas, L.J.: Heuristics for multilevel lot-sizing with a bottleneck. Manage. Sci. 32, 989–1006 (1986)
    Degraeve, Z., Jans, R.: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5), 909–920 (2007)
    Eppen, G.D., Martin, R.K.: Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6), 832–848 (1987)
    Federgruen, A., Meissner, J., Tzur, M.: Progressive interval heuristics for multi-item capacitated lot sizing problem. Oper. Res. 55(3), 490–502 (2007)
    Florian, M., Lenstra, J.K., Rinnooy Kan, H.G.: Deterministic production planning: algorithms and complexity. Manage. Sci. 26(7), 669–679 (1980)
    Helber, S., Sahling, F.: A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int. J. Prod. Econ. 123, 247–256 (2010)
    Kébé, S., Sbihi, N., Penz, B.: A lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem. J. Intell. Manuf. 23(6), 2477–2483 (2012)
    Krarup, J., Bilde, O.: Plant location, set covering and economic lotsizes: an O( $$mn$$ m n ) algorithm for structured problems. Optimierung bel Graphentheoretischen und Ganzzahligen Probleme, pp. 155–180. Birkhauser (1997)
    Küçükyavuz, S., Pochet, Y.: Uncapacitated lot-sizing with backlogging: The convex hull. Math. Program. 118(1), 151–175 (2009)
    Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.P.: On the polyhedral structure of a multi-item production planning model with setup times. Math. Program. 94(2–3), 375–405 (2003)
    MIPLIB. A library of pure and mixed integer problems (2010). http://miplib.zib.de/ . Accessed on 29 Dec 2014
    Multi-LSB. Multi-item lot-sizing problems with backlogging: a library of test instances (2014). http://dx.doi.org/10.15129/252b7827-b62b-4af4-8869-64b12b1c69a1 . Accessed 29 Dec 2014
    Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, Berlin (2006)
    Ramezanian, R., Saidi-Mehrabad, M.: Hybrid simulated annealing and mip-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system. Appl Math Modell 37(7), 5134–5147 (2013)
    Rardin, R.L., Wolsey, L.A.: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. 71(1), 95–109 (1993)
    Seeanner, F., Almada-Lobo, B., Meyr, H.: Combining the principles of variable neighborhood decomposition search and the fix & optimize heuristic to solve multi-level lot-sizing and scheduling problems. Comput. Oper. Res. 40(1), 303–317 (2013)
    Stadtler, H.: Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper. Res. 51, 487–502 (2003)
    Toledo, C.F.M., da Silva Arantes, M., de Oliveira, R.R.R., Almada-Lobo, B.: Glass container production scheduling through hybrid multi-population based evolutionary algorithm. Appl. Soft Comput. 13(3), 1352–1364 (2013)
    Toledo, C.F.M., de Oliveira, R.R.R., França, P.M.: A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40(4), 910–919 (2013)
    Van Vyve, M., Pochet, Y.: A general heuristic for production planning problems. INFORMS J. Comput. 16(3), 316–327 (2004)
    Wu, T., Shi, L., Geunes, J., Akartunalı, K.: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2), 428–441 (2011)