Two algorithms for no-wait flexible flowshop scheduling problem with no-idle machines

被引：0
|
作者：
Jin, Qingwei [1 ]
Xing, Wenxun [1 ]
机构：
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
来源：
Proceedings of the Sixth International Conference on Information and Management Sciences | 2007年 / 6卷
关键词：
makespan; flexible flowshop; no-wait; no-idle; heuristics;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We consider a two-stage flexible flowshop scheduling problem with no-wait jobs and no-idle time between two consecutive processes on each machine in the second stage. The numbers of machines in both stages are m(1) and m(2) with m(2) >= m(1). The processing times of jobs are all 1 in the first stage and not less than 1 in the second stage. A known algorithm is extended for this problem and a new algorithm with better performance is given. The bounds of the two algorithms are also presented.
引用
收藏
页码：636 / 640
页数：5
相关论文
共 50 条
  • [1] No-wait flexible flowshop scheduling with no-idle machines
    Wang, ZB
    Xing, WX
    Bai, FS
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 609 - 614
  • [2] No-wait or no-idle permutation flowshop scheduling with dominating machines
    Wang J.-B.
    Xia Z.-Q.
    [J]. Journal of Applied Mathematics and Computing, 2005, 17 (1-2) : 419 - 432
  • [3] FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES
    ADIRI, I
    POHORYLES, D
    [J]. NAVAL RESEARCH LOGISTICS, 1982, 29 (03) : 495 - 504
  • [4] HEURISTIC ALGORITHMS FOR SCHEDULING IN THE NO-WAIT FLOWSHOP
    GANGADHARAN, R
    RAJENDRAN, C
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 32 (03) : 285 - 290
  • [5] SOLVABLE CASES OF THE NO-WAIT FLOWSHOP SCHEDULING PROBLEM
    VANDERVEEN, JAA
    VANDAL, R
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1991, 42 (11) : 971 - 980
  • [6] Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
    Tolga Bektaş
    Alper Hamzadayı
    Rubén Ruiz
    [J]. Journal of Scheduling, 2020, 23 : 513 - 523
  • [7] No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (02) : 590 - 601
  • [8] The distributed no-idle permutation flowshop scheduling problem with due windows
    Mousighichi, Kasra
    Avci, Mualla Gonca
    [J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2024, 43 (04):
  • [9] A branch-and-bound approach to the no-idle flowshop scheduling problem
    Jarboui, Bassem
    Eddaly, Mansour
    [J]. DISCRETE APPLIED MATHEMATICS, 2024, 347 : 297 - 310
  • [10] Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
    Bektas, Tolga
    Hamzadayi, Alper
    Ruiz, Ruben
    [J]. JOURNAL OF SCHEDULING, 2020, 23 (04) : 513 - 523
12345