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 条
  • [31] Robust Metaheuristics for Scheduling Cellular Flowshop with Family Sequence-Dependent Setup Times
    Ibrahem, Al-mehdi
    Elmekkawy, Tarek
    Peng, Qingjin
    VARIETY MANAGEMENT IN MANUFACTURING: PROCEEDINGS OF THE 47TH CIRP CONFERENCE ON MANUFACTURING SYSTEMS, 2014, 17 : 428 - 433
  • [32] A bicriteria m-machine flowshop scheduling with sequence-dependent setup times
    Eren, Tamer
    APPLIED MATHEMATICAL MODELLING, 2010, 34 (02) : 284 - 293
  • [33] Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
    Mansouri, S. Afshin
    Hendizadeh, S. Hamed
    Salmasi, Nasser
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 40 (11-12): : 1216 - 1226
  • [34] Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
    S. Afshin Mansouri
    S. Hamed Hendizadeh
    Nasser Salmasi
    The International Journal of Advanced Manufacturing Technology, 2009, 40 : 1216 - 1226
  • [35] General flowshop scheduling problem with the sequence dependent setup times: A heuristic approach
    Ziaee, Mohsen
    INFORMATION SCIENCES, 2013, 251 : 126 - 135
  • [36] SCHEDULING SEQUENCE-DEPENDENT COLOUR PRINTING JOBS
    Schuurman, J.
    van Vuuren, J. H.
    SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING, 2016, 27 (02): : 43 - 59
  • [37] Flowshop scheduling to minimize the sum of weighted tardiness cost and weighted flowtime cost by synergy of heuristics
    Sambandam, Narayanasamy
    Maniyan, Paranjothi
    WMSCI 2007: 11TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL I, PROCEEDINGS, 2007, : 335 - 339
  • [38] Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    Rajendran, C
    Ziegler, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (02) : 426 - 438
  • [39] Scheduling jobs with uncertain setup times and sequence dependency
    Chinese University of Hong Kong, Shatin, Hong Kong
    不详
    不详
    Omega, 4 (437-447):
  • [40] A FLOWSHOP PROBLEM WITH SEQUENCE-DEPENDENT ADDITIVE SETUP TIMES
    SZWARC, W
    GUPTA, JND
    NAVAL RESEARCH LOGISTICS, 1987, 34 (05) : 619 - 627