دانشگاه شهید مدنی آذربایجان

 آمار

تعداد نشریات5
تعداد شماره‌ها116
تعداد مقالات1,355
تعداد مشاهده مقاله1,360,922
تعداد دریافت فایل اصل مقاله1,313,053
Tran, Hiep, Phung, Duc, Nguyen, Kien Trung. (1404). The minimum cost problem of downgrading minimum lateness scheduling under uncertainty. , (), -. doi: 10.22049/cco.2025.30140.2332
Hiep Thanh Tran; Duc Minh Phung; Kien Trung Nguyen. "The minimum cost problem of downgrading minimum lateness scheduling under uncertainty". , , , 1404, -. doi: 10.22049/cco.2025.30140.2332
Tran, Hiep, Phung, Duc, Nguyen, Kien Trung. (1404). 'The minimum cost problem of downgrading minimum lateness scheduling under uncertainty', , (), pp. -. doi: 10.22049/cco.2025.30140.2332
Tran, Hiep, Phung, Duc, Nguyen, Kien Trung. The minimum cost problem of downgrading minimum lateness scheduling under uncertainty. , 1404; (): -. doi: 10.22049/cco.2025.30140.2332

The minimum cost problem of downgrading minimum lateness scheduling under uncertainty

Communications in Combinatorics and Optimization
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 19 تیر 1404
نوع مقاله: Original paper
شناسه دیجیتال (DOI): 10.22049/cco.2025.30140.2332
نویسندگان
Hiep Thanh Tran1، 2، 3؛ Duc Minh Phung2، 4؛ Kien Trung Nguyen* 5
1Department of Applied Mathematics, Faculty of Applied Sciences, Ho Chi Minh University of Technology (HCMUT), 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam
2Vietnam National University Ho Chi Minh City, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam
3Department of Mathematics, FPT University (HCM City Campus), Vietnam
4Department of Mathematics and Physics, University of Information Technology, Ho Chi Minh City, Vietnam
5Faculty of Mathematics and Informatics, Teacher College, Can Tho University, Can Tho, Vietnam
چکیده
The minimum lateness scheduling problem seeks to create a schedule that minimizes the largest lateness of the system. This paper deals with the challenge of increasing the processing time of jobs in a minimum cost such that the minimum lateness attains a given bound. It is called the minimum cost problem of downgrading minimum lateness scheduling. Additionally, the modifying costs are represented as intervals, and we apply the minmax regret criterion to address this uncertainty. Our contribution is an $O(n^2)$ algorithm for solving the corresponding robust problem.
کلیدواژه‌ها
Robust optimization؛ Downgrading problem؛ Scheduling؛ Lateness
آمار
تعداد مشاهده مقاله: 3


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب