Single-machine scheduling with a time-dependent learning effect
نویسندگان
چکیده
منابع مشابه
Single-machine Scheduling with an Actual Time-dependent Learning Consideration
This paper deals with single-machine scheduling problems with an actual time-dependent learning consideration. First, we provide a mathematical description of learning effects in scheduling environment. Then we introduce an actual time-dependent learning model, in which the learning effect is defined a function of the ratio of sum of actual processing times of the jobs previously scheduled to t...
متن کاملSingle Machine Scheduling Problems with Time-dependent Learning Effects
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملSingle-machine scheduling with time window-dependent processing times
In the one-machine scheduling problems analysed in this paper, the processing time of a job depends on the time at which the job is started. More precisely, the horizon is divided into time windows and with each one a coe cient is associated that is used to determine the actual processing time of a job starting in it. Two models are introduced, and one of them has direct connections with models...
متن کاملSingle-machine scheduling with waiting-time-dependent due dates
We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Economics
سال: 2008
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2007.03.013