A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function

详细信息	查看全文 | 推荐本文 |

• 作者：Chin-Chia Wu^a ; Wen-Hung Wu^b ; Peng-Hsiang Hsu^a ; Kunjung Lai^a ; ^{kjlai@mail.fcu.edu.tw}
• 关键词：Scheduling ; Two-machine ; Genetic algorithm ; Truncated learning function
• 刊名：Applied Mathematical Modelling
• 出版年：2012
• 期刊代码：6_0307904x
• 类别：cp
• 出版时间：October, 2012
• 卷：36
• 期：10
• 页码：5001-5014
• 文件大小：219 K

摘要

Scheduling with learning effects has received continuing attention in the recent days. However, it can be found that the actual processing time of a given job drops to zero precipitously as the job has a big processing time or the number of jobs increases. Moreover, most researchers paid more attention to single-machine settings, and the flowshop settings then are relatively unexplored. Motivated by these observations, we consider a two-machine total completion time flowshop problem in which the actual job processing time is a function depending on the jobs that have already been processed and a control parameter. In this paper, we develop a branch-and-bound and a genetic heuristic-based algorithm for the problem. In addition, the experimental results of all proposed algorithms are also provided.