Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times-based learning effect
by Chin-Chia Wu; Yunqiang Yin; Wen-Hsiang Wu; Shuenn-Ren Cheng
European J. of Industrial Engineering (EJIE), Vol. 6, No. 4, 2012

Abstract: Recently, scheduling with learning effects has received growing attention. A well-known learning model is called 'sum-of processing-times-based learning' where the actual processing time of a job is a non-increasing function of the jobs already processed. However, the actual processing time of a given job drops to zero precipitously when the normal job processing times are large. Motivated by this observation, this paper develops a truncated learning model in which the actual job processing time not only depends on the processing times of the jobs already processed but also depends on a control parameter. The use of the truncated function is to model the phenomenon that the learning of a human activity is limited. In this paper, some single-machine scheduling problems can be solved in polynomial time. Besides, the error bounds are also provided for the problems to minimise the maximum lateness and the total weighted completion time. [Received 20 September 2010; Revised 11 November 2010, 22 January 2011; Accepted 5 February 2011]

Online publication date: Wed, 10-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com