521
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products

ORCID Icon, ORCID Icon & ORCID Icon
Pages 1691-1706 | Received 10 Apr 2018, Accepted 29 Jun 2019, Published online: 27 Aug 2019

References

  • Afzalirad, M., & Rezaeian, J. (2016). Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Computers & Industrial Engineering, 98, 40–52. doi:10.1016/j.cie.2016.05.020
  • Akartunalı, K., Fragkos, I., Miller, A., & Wu, T. (2016). Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS Journal on Computing, 28(4), 766–780. doi:10.1287/ijoc.2016.0712
  • Akartunalı, K., & Miller, A. (2009). A heuristic approach for big bucket multi-level production planning problems. European Journal of Operational Research, 193(2), 396–411. doi:10.1016/j.ejor.2007.11.033
  • Almada-Lobo, B., Clark, A., Guimarães, L., Figueira, G., & Amorim, P. (2015). Industrial insights into lot sizing and scheduling modeling. Pesquisa Operacional, 35(3), 439–464. doi:10.1590/0101-7438.2015.035.03.0439
  • Almeder, C., & Almada-Lobo, B. (2011). Synchronisation of scarce resources for a parallel machine lotsizing problem. International Journal of Production Research, 49(24), 7315–7335. doi:10.1080/00207543.2010.535570
  • Brahimi, N., Absi, N., Dauzère-Pérès, S., & Nordli, A. (2017). Single-item dynamic lot-sizing problems: An updated survey. European Journal of Operational Research, 263(3), 838–863. doi:10.1016/j.ejor.2017.05.008
  • Copil, K., Wörbelauer, M., Meyr, H., & Tempelmeier, H. (2017). Simultaneous lotsizing and scheduling problems: A classification and review of models. Or Spectrum, 39(1), 1–64. doi:10.1007/s00291-015-0429-4
  • Costa, A. M., dos Santos, L. M. R., Alem, D. J., & Santos, R. H. (2014). Sustainable vegetable crop supply problem with perishable stocks. Annals of Operations Research, 219(1), 265–283. doi:10.1007/s10479-010-0830-y
  • Dillenberger, C., Escudero, L. F., Wollensak, A., & Zhang, W. (1994). On practical resource allocation for production planning and scheduling with period overlapping setups. European Journal of Operational Research, 75(2), 275–286. doi:10.1016/0377-2217(94)90074-4
  • Doostmohammadi, M., & Akartunalı, K. (2018). Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case. European Journal of Operational Research, 2671, 86–95. doi:10.1016/j.ejor.2017.11.014
  • Glock, C. H., Grosse, E. H., & Ries, J. M. (2014). The lot sizing problem: A tertiary study. International Journal of Production Economics, 155, 39–51. doi:10.1016/j.ijpe.2013.12.009
  • Güngör, M., Ünal, A. T., & Taşkın, Z. C. (2017). A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand. International Journal of Production Research, 56(9), 1–14. doi:10.1080/00207543.2017.1406675
  • Haase, K. (1996). Capacitated lot-sizing with sequence dependent setup costs. Operations-Research-Spektrum, 18(1), 51–59. doi:10.1007/BF01539882
  • James, R. J., & Almada-Lobo, B. (2011). Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics. Computers & Operations Research, 38(12), 1816–1825. doi:10.1016/j.cor.2011.02.005
  • Lütke Entrup, M., Günther, H.-O., Van Beek, P., Grunow, M., & Seiler, T. (2005). Mixed-integer linear programming approaches to shelf-life-integrated planning and scheduling in yoghurt production. International Journal of Production Research, 43(23), 5071–5100. doi:10.1080/00207540500161068
  • Meyr, H., & Mann, M. (2013). A decomposition approach for the general lotsizing and scheduling problem for parallel production lines. European Journal of Operational Research, 229(3), 718–731. doi:10.1016/j.ejor.2013.03.036
  • Özdamar, L., & Birbil,Ş. I. (1998). Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research, 110(3), 525–547. doi:10.1016/S0377-2217(97)00269-5
  • Sel, Ç., & Bilgen, B. (2014). Hybrid simulation and mip based heuristic algorithm for the production and distribution planning in the soft drink industry. Journal of Manufacturing Systems, 33(3), 385–399. doi:10.1016/j.jmsy.2014.01.002
  • Smith-Daniels, V., & Ritzman, L. P. (1988). A model for lot sizing and sequencing in process industries. The International Journal of Production Research, 26(4), 647–674. doi:10.1080/00207548808947890
  • Soler, W. A. O., & Santos, M. O. (2017). A new branching rule to solve the capacitated lot sizing and scheduling problem with sequence dependent setups. Tema (São Carlos), 18, 515–529. doi:10.5540/tema.2017.018.03.515
  • Suerie, C., & Stadtler, H. (2003). The capacitated lot-sizing problem with linked lot sizes. Management Science, 49(8), 1039–1054. doi:10.1287/mnsc.49.8.1039.16406
  • Toledo, C. F. M., Silva Arantes, M. D., 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
  • Villa, F., Vallada, E., & Fanjul-Peyro, L. (2018). Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource. Expert Systems with Applications, 93, 28–38. doi:10.1016/j.eswa.2017.09.054.
  • Xiao, J., Yang, H., Zhang, C., Zheng, L., & Gupta, J. N. (2015). A hybrid lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Computers & Operations Research, 63, 72–82. doi:10.1016/j.cor.2015.04.010

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.