Authors: Yunqiang Yin; Chin-Chia Wu; Wen-Hung Wu; Juei-Chao Chen
Addresses: School of Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China ' Department of Statistics, Feng Chia University, No. 100, Wenhwa Rd., Seatwen, Taichung, Taiwan ' Department of Business Administration, Kang-Ning Junior College, No. 137, Lane 75, Sec. 3, Kangning Rd., Neihu District, Taipei City 114, Taiwan ' Department of Statistics and Information Science, and Graduate Institute of Applied Statistics, Fu-Jen Catholic University, No. 510 Zhongzheng Rd., Xinzhuang Dist., New Taipei City 24205, Taiwan
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]
Keywords: single-machine scheduling; learning effect; group scheduling; group technology.
European Journal of Industrial Engineering, 2013 Vol.7 No.3, pp.350 - 369
Published online: 22 May 2013 *Full-text access for editors Access for subscribers Purchase this article Comment on this article