Time-Dependent Learning Effect and Deterioration on Single Machineas Scheduling
Learning effect and deterioration do not always occur separately. If both of them are founded simultaneously, the actual processing time of the jobs will both increase and decrease at the same time. The actual processing time is defined by a function of the starting time and position of jobs in the sequence. In this paper, the effect of learning and deterioration is applied to single machine’s scheduling problem in a paper-mill. Learning effect as a result of regular performance-evaluation reduce the effect of deterioration up to 206, 5509 hours. This paper-mill operates jobs by their interest. This paper show that Earlier Due Date (EDD) rule construct a better sequence under maximum lateness problem then either Shortest Processing Time (SPT) rule or Most Urgent Job rule do. Maximum lateness of the jobs under EDD rule is 13,6% less then sequence that is recently used.
