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

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

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.

Details

Original languageEnglish
Title of host publicationOperations Research Proceedings 2024
EditorsLukas Glomb
PublisherSpringer, Cham
Pages472–478
Number of pages7
ISBN (electronic)978-3-031-92575-7
ISBN (print)978-3-031-92574-0
Publication statusPublished - 12 Aug 2025
Peer-reviewedYes

Publication series

SeriesLecture Notes in Operations Research
ISSN2731-040X

External IDs

ORCID /0000-0002-7958-9721/work/189707857
ORCID /0000-0001-6942-3763/work/190133922
Scopus 105017052820

Keywords

Research priority areas of TU Dresden

Keywords

  • DPFSP, factory eligibility, distributed scheduling, qualification options