کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1705146 1012425 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
چکیده انگلیسی

This paper considers the problems of scheduling with the effect of learning on a single-machine under group technology assumption. We propose a new learning model where the job actual processing time is linear combinations of the scheduled position of the job and the sum of the normal processing time of jobs already processed. We show that the makespan minimization problem is polynomially solvable. We also prove that the total completion time minimization problem with the group availability assumption remains polynomially solvable under agreeable conditions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 35, Issue 5, May 2011, Pages 2068–2074
نویسندگان
, ,