Flowshop scheduling problem to minimize total completion time with random and bounded processing times

被引：26
|
作者：
Sotskov, YN
Allahverdi, A
Lai, TC
机构：
[1] Kuwait Univ, Coll Engn & Petr, Dept Ind & Management Syst Engn, Safat 13060, Kuwait
[2] United Inst Informat Problems, Minsk, BELARUS
[3] Natl Taiwan Univ, Taipei 10764, Taiwan
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2004年 / 55卷 / 03期
关键词：
scheduling; flowshop; uncertainty; geometrical approach; total completion time;
D O I：
10.1057/palgrave.jors.2601682
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The flowshop scheduling problems with n jobs processed on two or three machines, and with two jobs processed on k machines are addressed where jobs have random and bounded processing times. The probability distributions of random processing times are unknown, and only the lower and upper bounds of processing times are given before scheduling. In such cases, there may not exist a unique schedule that remains optimal for all feasible realizations of the processing times, and therefore, a set of schedules has to be considered which dominates all other schedules for the given criterion. We obtain sufficient conditions when transposition of two jobs minimizes total completion time for the cases of two and three machines. The geometrical approach is utilized for flowshop problem with two jobs and k machines.
引用
下载
收藏
页码：277 / 286
页数：10
相关论文
共 50 条
  • [21] Distributed permutation flowshop scheduling problem with total completion time objective
    Arshad Ali
    Yuvraj Gajpal
    Tarek Y. Elmekkawy
    OPSEARCH, 2021, 58 : 425 - 447
  • [22] A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
    Aydilek, Harun
    Allahverdi, Ali
    APPLIED MATHEMATICAL MODELLING, 2013, 37 (12-13) : 7164 - 7173
  • [23] Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times
    Fondrevelle, J.
    Oulamara, A.
    Portmann, M. -C.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (01) : 168 - 176
  • [24] Scheduling with random processing times to minimize completion time variance on a single machine subject to stochastic breakdowns
    Jia, CF
    PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 743 - 747
  • [25] Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
    Aydilek, Harun
    Aydilek, Asiye
    Allahverdi, Ali
    ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1417 - 1430
  • [26] Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times
    Behjat, Saeed
    Salmasi, Nasser
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2017, 11 (01) : 22 - 48
  • [27] Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective
    Sotskov, Yuri N.
    Egorova, Natalja G.
    ALGORITHMS, 2018, 11 (05)
  • [28] Open shop scheduling problem to minimize total weighted completion time
    Bai, Danyu
    Zhang, Zhihai
    Zhang, Qiang
    Tang, Mengqian
    ENGINEERING OPTIMIZATION, 2017, 49 (01) : 98 - 112
  • [29] A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
    Tang, LX
    Xuan, H
    Liu, JY
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (11) : 3344 - 3359
  • [30] Reentrant hybrid flowshop scheduling problem based on total weighted completion time
    Xuan H.
    Li B.
    Luo S.-M.
    Wang X.-Y.
    Kongzhi yu Juece/Control and Decision, 2018, 33 (12): : 2218 - 2226
12345