Single-machine group scheduling with a general learning effect Online publication date: Fri, 28-Feb-2014
by Yunqiang Yin; Chin-Chia Wu; Wen-Hung Wu; Juei-Chao Chen
European J. of Industrial Engineering (EJIE), Vol. 7, No. 3, 2013
Abstract: This paper investigates some single-machine scheduling problems with a general learning effect and the group technology assumption. A setup time is incurred whenever the single machine transfers job processing from a family to another family. By the general learning effect, we mean that the actual group setup time depends not only on the total setup time of the groups already processed but also on its scheduled position, and the actual processing time of a job in a certain group depends not only on the total normal processing time of the jobs already processed in the group but also on its scheduled position. We show that the makespan minimisation problem remains polynomially solvable under the proposed models. We also show that the problems of minimising the total completion time, the total weighted completion time and the discounted total weighted completion time of all jobs have polynomial optimal solutions under certain conditions. [Received 16 March 2011; Revised 4 August 2011, 12 October 2011; Accepted 16 October 2011]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook