Work

Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms

Year: 2024

Type: article

Abstract: Volatility in the supply chain of critical products, notably the vaccine shortage during the pandemic, influences livelihoods and may lead to significant delays and long waiting times. Considering the capital- and time-intensive nature of capacity expansion plans, strategic operational production decisions are required best to address the supply-demand mismatches given the limited production resources. This research article investigates the production scenarios where the demand of one agent must be completed within a specified due date, hereinafter referred to as the deadline, while minimizing the maximum or total completion time of another agent's demand. For this purpose, the Two-Agent Proportionate Flowshop Scheduling Problem with deadlines is introduced. Two polynomial-time optimization algorithms are developed to solve these optimization problems. This study will serve as a basis for further developing this practical yet understudied scheduling problem.

Source: Annals of Operations Research

DOI: 10.1007/s10479-024-06275-z

Authors: Kuo-Ching Ying, Pourya Pourhejazy, Chuan-En Sung

Institutions: National Taipei University of Technology, UiT The Arctic University of Norway, Powertech Technology (Taiwan)

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,990

Funder: Universitetet i Tromsø