Autor: |
LAM QUOC ANH, HUY MINH LE, KIEN TRUNG NGUYEN, LE XUAN THANH |
Předmět: |
|
Zdroj: |
Applied Set-Valued Analysis & Optimization; 2024, Vol. 6 Issue 3, p263-273, 11p |
Abstrakt: |
This paper addresses the robust downgrading (single-machine) makespan scheduling problem, a scheduling challenge where processing times are augmented at a minimum cost to achieve a specified downgrading level in the makespan. The associated costs are modeled as intervals, and we employ the minmax regret criterion to handle uncertainty. The deterministic case is initially examined with a lineartime algorithm. Subsequently, the robust version of the problem is transformed into a single-variable objective, characterized by a piecewise linear function. Then, we develop a combinatorial algorithm with polynomial time complexity to solve the corresponding problem. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|