IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i1d10.1007_s10696-023-09484-z.html
   My bibliography  Save this article

Modeling and scheduling of production systems by using max-plus algebra

Author

Listed:
  • Hazem Bermanei

    (Turku University of Applied Sciences)

  • Jari M. Böling

    (Åbo Akademi University)

  • Göran Högnäs

    (Åbo Akademi University)

Abstract

Max-plus algebra provides mathematical methods for solving nonlinear problems by using linear equations. These kinds of the problems arise in areas such as manufacturing, transportation, allocation of resources, and information processing technology. In this paper, the scheduling of production systems consisting of many stages and different units is considered, where some of the units can be used for many stages. If a production unit is used for different stages cleaning is needed in between, while no cleaning is needed between stages of the same type. Cleaning of units takes a significant amount of time, which is considered in the scheduling. The goal is to minimize the total production time, and such problems are often solved by using numerical optimization. In this paper a max-plus formalism is used for the modeling and scheduling of such production systems. Structural decisions such as choosing one unit over another proved to be difficult in the latter case, but this can be viewed as a switching max-plus linear system. No switching (and thus no cleaning) is considered as a base case, but for larger production batches the durability constraints will require switches. Switching as seldom as possible is shown to be optimal. Scheduling of a small production system consisting of 6 stages and 6 units is used as a case study.

Suggested Citation

  • Hazem Bermanei & Jari M. Böling & Göran Högnäs, 2024. "Modeling and scheduling of production systems by using max-plus algebra," Flexible Services and Manufacturing Journal, Springer, vol. 36(1), pages 129-150, March.
  • Handle: RePEc:spr:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09484-z
    DOI: 10.1007/s10696-023-09484-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-023-09484-z
    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/s10696-023-09484-z?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.

    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:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09484-z. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.