IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-92575-7_67.html
   My bibliography  Save this book chapter

Optimization of Distributed Permutation Flowshops Considering Eligibility Constraints and Limited Qualification Options

Author

Listed:
  • Martin Schönheit

    (TU Dresden, Chair of Business Administration, esp. Logistics)

  • Rainer Lasch

    (TU Dresden, Chair of Business Administration, esp. Logistics)

Abstract

The trend towards decentralized production increases the complexity of operational processes. To address the complexity of scheduling in production networks, this paper investigates a centralized solution approach for a distributed permutation flow shop problem. The fundamental model is extended by integrating factory eligibility constraints and options to qualify factories via tool or personnel relocation. Further, costs for emitting carbon emissions due to production, tool transfer, and job delivery are considered. The study focuses on a bi-objective optimization problem, aiming to minimize total weighted tardiness and total cost. Factory-dependent due dates, limited transport capacity and processing time deviation enhance practical relevance. A computational study examines the impact of increased carbon emission prices and limited transfer options. Key findings indicate that scheduling decisions strongly depend on factory and customer locations, factory eligibility, and tool/product weight, emphasizing the importance of considering transportation as a decisive factor in distributed scheduling.

Suggested Citation

  • Martin Schönheit & Rainer Lasch, 2025. "Optimization of Distributed Permutation Flowshops Considering Eligibility Constraints and Limited Qualification Options," Lecture Notes in Operations Research,, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-92575-7_67
    DOI: 10.1007/978-3-031-92575-7_67
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:lnopch:978-3-031-92575-7_67. 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.