Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects
In this paper we consider the single machine scheduling problems with sum-of-logarithm-processing-times based and position based learning effects, i.e., the actual job processing time of a job is a function of the sum of the logarithms of the processing times of the jobs already processed and its position in a sequence. The logarithm function is used to model the phenomenon that learning as a human activity is subject to the law of diminishing return. We show that even with the introduction of the proposed model to job processing times, several single machine problems remain polynomially solvable.
KeywordsScheduling Single machine Learning effect
Unable to display preview. Download preview PDF.
- 15.Pinedo M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River (2002)Google Scholar
- 29.Zhang, X., Yan, G., Zhang, F., Tang, G.: Machine scheduling algorithm with a new learning effect. J. Syst. Sci. Math. Sci. 30, 1359–1367 (2010, in Chinese)Google Scholar