.png){kind=icon}
.png){kind=icon}
Return
Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-024-06275-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W