Reducing mean flow time in permutation flow shop

被引：8
作者：
Nagano, M. S. [1 ]
Moccellin, J. V. [1 ]
机构：
[1] Univ Sao Paulo, Sch Engn, BR-13566590 Sao Carlos, SP, Brazil
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2008年 / 59卷 / 07期
关键词：
scheduling; heuristic algorithm; flow shop; mean flowtime;
D O I：
10.1057/palgrave.jors.2602395
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper deals with the traditional permutation flow shop scheduling problem with the objective of minimizing mean flowtime, therefore reducing in-process inventory. A new heuristic method is proposed for the scheduling problem solution. The proposed heuristic is compared with the best one considered in the literature. Experimental results show that the new heuristic provides better solutions regarding both the solution quality and computational effort.
引用
收藏
页码：939 / 945
页数：7
相关论文
共 15 条
12