IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v1y2020i4d10.1007_s43069-020-00035-y.html
   My bibliography  Save this article

Planning Production and Workforce in a Discrete-Time Financial Model Using Scenarios Modeling

Author

Listed:
  • Pedro Martins

    (Polytechnic Institute of Coimbra
    University of Lisbon)

Abstract

Production planning interacts with a number of functional aspects within the entire system of a company. Two of those aspects involve workforce and financial planning, which are usually conflicting, in the sense that more workforce increases the financial costs but it may also increase production capability. In effect, there should exist an adequate balance on the production levels such that the cash-flows can generate the highest profits. This suggests that these three elements of the system (production, workforce and cash-flows) are tightly connected, and that they should be planned together in a single framework. This paper explores this interaction using a mixed integer linear programming formulation for a general outline of this three elements system. The model includes sequences of overlapping work-shifts and sequences of overlapping short-term loans. We discuss a number of scenarios concerning some of the uncertain parameters involved in the process, assuming that they do not follow any known distribution function, so handling uncertainty using a scenarios modeling methodology. Contrarily to usual lot-sizing problems, we consider demand as an upper limit for setting the production. So, we want to plan production and workforce in order to assist the cash-flows along the planning horizon, to the best convenience of the financial profits. We discuss a small fictitious example using a single-product with a homogeneous type of workers in the process. We then indicate a number of generalizations, including some real-world applications.

Suggested Citation

  • Pedro Martins, 2020. "Planning Production and Workforce in a Discrete-Time Financial Model Using Scenarios Modeling," SN Operations Research Forum, Springer, vol. 1(4), pages 1-22, December.
  • Handle: RePEc:spr:snopef:v:1:y:2020:i:4:d:10.1007_s43069-020-00035-y
    DOI: 10.1007/s43069-020-00035-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-020-00035-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s43069-020-00035-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. LOPARIC, Marko & POCHET, Yves & WOLSEY, Laurence A., 2001. "The uncapacitated lot-sizing problem with sales and safety stocks," LIDAM Reprints CORE 1498, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    3. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    4. BELVAUX, Gaetan & WOLSEY, Laurence A., 2001. "Modelling practical lot-sizing problems as mixed-integer programs," LIDAM Reprints CORE 1516, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Wolfgang Albrecht & Martin Steinrücke, 2017. "Continuous-time production, distribution and financial planning with periodic liquidity balancing," Journal of Scheduling, Springer, vol. 20(3), pages 219-237, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    2. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    3. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    4. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
    5. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    6. Moo-Sung Sohn & Jiwoong Choi & Hoseog Kang & In-Chan Choi, 2017. "Multiobjective Production Planning at LG Display," Interfaces, INFORMS, vol. 47(4), pages 279-291, August.
    7. Kovcs, Andrs & Brown, Kenneth N. & Tarim, S. Armagan, 2009. "An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups," International Journal of Production Economics, Elsevier, vol. 118(1), pages 282-291, March.
    8. Almeder, Christian & Klabjan, Diego & Traxler, Renate & Almada-Lobo, Bernardo, 2015. "Lead time considerations for the multi-level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 727-738.
    9. Kerem Akartunalı & 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, INFORMS, vol. 28(4), pages 766-780, November.
    10. Stadtler, Hartmut, 2011. "Multi-level single machine lot-sizing and scheduling with zero lead times," European Journal of Operational Research, Elsevier, vol. 209(3), pages 241-252, March.
    11. Chen, Haoxun, 2015. "Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems," Omega, Elsevier, vol. 56(C), pages 25-36.
    12. Natashia L. Boland & Martin W. P. Savelsbergh, 2019. "Perspectives on integer programming for time-dependent models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 147-173, July.
    13. Egri, Péter & Kis, Tamás & Kovács, András & Váncza, József, 2014. "An inverse economic lot-sizing approach to eliciting supplier cost parameters," International Journal of Production Economics, Elsevier, vol. 149(C), pages 80-88.
    14. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    15. Brian T. Denton & John Forrest & R. John Milne, 2006. "IBM Solves a Mixed-Integer Program to Optimize Its Semiconductor Supply Chain," Interfaces, INFORMS, vol. 36(5), pages 386-399, October.
    16. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    17. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    18. Narayanan, Arunachalam & Robinson, Powell, 2010. "Efficient and effective heuristics for the coordinated capacitated lot-size problem," European Journal of Operational Research, Elsevier, vol. 203(3), pages 583-592, June.
    19. Mitra, Sumit & Sun, Lige & Grossmann, Ignacio E., 2013. "Optimal scheduling of industrial combined heat and power plants under time-sensitive electricity prices," Energy, Elsevier, vol. 54(C), pages 194-211.
    20. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:1:y:2020:i:4:d:10.1007_s43069-020-00035-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.