Release Time:2019-03-11  Hits:

Indexed by: Journal Article

Date of Publication: 2010-08-01

Journal: ICIC Express Letters

Included Journals: Scopus、EI

Volume: 4

Issue: 4

Page Number: 1345-1350

ISSN: 1881803X

Abstract: In this paper we introduce a new scheduling model with an exponential sum-cf-processing-time based learning effect in which the actual processing time of a job is defined by an exponential function of the total normal processing time of the already processed jobs. We show that even with the introduction of the new learning effect to job processing times, single machine problems to minimize makespan and the sum of the 9th power of the completion times remain polynomially solvable. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. ICIC International ? 2010 ISSN 1881-803X.