EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1724. A bi-objective distributed permutation flowshop scheduling problem with factory eligibility and qualification options

Invited abstract in session WB-49: Flow shop scheduling problems, stream Lot Sizing, Lot Scheduling and Production Planning.

Wednesday, 10:30-12:00
Room: M1 (building: 101)

Authors (first author is the speaker)

1. Martin Schönheit
Chair of Business Administration, esp. Logistics, TU Dresden

Abstract

The competitiveness of manufacturing companies, especially those with multiple plants, is increasingly determined by their operational efficiency and agility. A challenging issue when considering multiple factories is the optimal allocation and scheduling of orders, which is further complicated by the lack of tools and personnel that limit the ability to process an order in each factory. Thus, this paper contributes by solving a bi-objective distributed permutation flow shop scheduling problem with eligibility constraints focusing on minimizing total cost and total weighted tardiness.
For the first time, factory-dependent due dates and qualification options through tool transfer to an initially ineligible factory are investigated. In addition, emission costs are considered alongside transfer, delivery, and production costs to promote a holistic problem view. Extensive computational experiments are used to analyze the effects of varying the strictness of factory eligibility constraints, changes in product and tool weight factor levels, and an increase in the emission price. The results illustrate the critical role of transportation in distributed scheduling and highlight the benefits of factory qualification in terms of on-time order delivery and cost minimization. Finally, the integration of factory eligibility constraints and factory-dependent due dates strengthens the robustness of the management implications by better reflecting industry constraints.

Keywords

Status: accepted

Back to the list of papers