کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476458 699477 2005 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
چکیده انگلیسی

In this paper, we study a scheduling problem on identical parallel machines, in which a processing time and a due date are given for each job, and the objective is to maximize the number of just-in-time jobs. A job is called just-in-time if it is completed exactly on its due date. We discuss the known results, show that a recently published greedy algorithm for this problem is incorrect, and present a new quadratic time algorithm which solves the problem.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 32, Issue 12, December 2005, Pages 3265–3271
نویسندگان
, ,