کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1135691 956109 2007 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times
چکیده انگلیسی

We consider single-resource scheduling when candidate jobs may be accepted (producing job-specific profit) or rejected. Our solution approaches seek to maximize the profitability of the resulting schedule under job-specific tardiness costs and reducible processing times (at a cost). We present an algorithm that maximizes schedule profit for a given sequence of jobs, along with two heuristic approaches for generating good job sequences. A set of computational tests on randomly generated problem instances demonstrates the relative effectiveness of our proposed heuristic approaches.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 53, Issue 3, October 2007, Pages 420–432
نویسندگان
, ,