کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5128247 | 1489490 | 2017 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We consider the Pareto-scheduling with bi-criteria on a single machine in which each task has a positional due index. Two bi-criteria problems are considered: (a) Pareto-scheduling with two agents A and B for minimizing the total completion time of A-tasks and a maximum cost of B-tasks with precedence constraints. (b) Pareto-scheduling under precedence constraints for minimizing two maximum costs of tasks. We show in this paper that the two problems are both solvable in polynomial time. The second result also implies that the Pareto-scheduling under precedence constraints for minimizing two agents' maximum costs is solvable in polynomial time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 25, August 2017, Pages 105-119
Journal: Discrete Optimization - Volume 25, August 2017, Pages 105-119
نویسندگان
Yuan Gao, Jinjiang Yuan,