A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs

被引:18
|
作者
Rajendran, C [1 ]
Ziegler, H [1 ]
机构
[1] UNIV PASSAU,FAC BUSINESS ADM & ECON,D-94030 PASSAU,GERMANY
关键词
scheduling; flowshop; sequence-dependent setup times; weighted flowtime; heuristics;
D O I
10.1016/S0360-8352(97)00093-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The problem of scheduling in a static flowshop with sequence-dependent setup times of jobs (FSDS) is considered in this paper. A new heuristic to minimize the sum of weighted flowtime of jobs in a FSDS is proposed. An improvement scheme is supplemented to enhance the quality of the heuristic solution. An extensive computational performance analysis has shown that the proposed heuristic is computationally faster and more effective in yielding solutions of better quality than the existing heuristic. An interesting observation is that even though the proposed heuristic aims to minimize the sum of weighted flowtime of jobs (just like the existing heuristic), it fares much better than the existing heuristic in minimizing the maximum weighted flowtime of a job too. (C) 1997 Elsevier Science Ltd.
引用
收藏
页码:281 / 284
页数:4
相关论文
共 50 条