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

Kuo-Ching Ying, Pourya Pourhejazy () and Chuan-En Sung
Additional contact information
Kuo-Ching Ying: National Taipei University of Technology
Pourya Pourhejazy: UiT- The Arctic University of Norway
Chuan-En Sung: National Taipei University of Technology

Annals of Operations Research, 2024, vol. 343, issue 1, No 20, 543-558

Abstract: 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.

Keywords: Short-term production planning; Multi-agent scheduling; Conflicting tasks; Polynomial-time optimization (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06275-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:343:y:2024:i:1:d:10.1007_s10479-024-06275-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06275-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().