کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5777208 1632576 2016 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The Prize-collecting Scheduling Problem with Deadlines
ترجمه فارسی عنوان
مشکل زمانبندی جمع آوری جایزه با مهلت
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی

We study a prize-collecting single machine scheduling problem with hard deadlines, where the objective is to minimise the difference between the total tardiness and the total prize of selected jobs. This problem is motivated by industrial applications, both as a standalone model and as a pricing problem for column generation approaches to parallel machine scheduling problems. It is handled through the use of exact approaches, in the form of a Branch and Bound (B&B) algorithm and an Integer Linear Programming (ILP) formulation. The B&B and ILP formulation are compared in their efficiency on randomly generated benchmark instances.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 55, November 2016, Pages 57-60
نویسندگان
, , ,