Dynamic Job Sequencing in Two Parallel Two-Machine Flow Shop

被引：0
作者：
Osman, Mojahid F. Saeed [1 ]
机构：
[1] Amer Univ Sharjah, Dept Ind Engn, Sharjah, U Arab Emirates
来源：
2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2015年
关键词：
Flow shops; Dynamic sequencing; Parallel Processing; SCHEDULING PROBLEMS; MAKESPAN; HEURISTICS; BENCHMARKS;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, the case where there are two parallel two-machine flow-shops available to process jobs is considered. We developed a method that creates sequences intended to dynamically minimize the makespan while jobs are added overtime. The solution procedure developed in this research is demonstrated using an illustrative example. The results revealed the effectiveness of the proposed approach for solving dynamic sequencing problem with two parallel two-machine flow-shops.
引用
收藏
页码：485 / 488
页数：4
相关论文
共 50 条
  • [41] Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints
    Zhao, Chuanli
    Tang, Hengyong
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 136 (01) : 131 - 136
  • [42] Exact method for the two-machine flow-shop problem with time delays
    Mkadem, Mohamed Amine
    Moukrim, Aziz
    Serairi, Mehdi
    ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 375 - 406
  • [43] Exact method for the two-machine flow-shop problem with time delays
    Mohamed Amine Mkadem
    Aziz Moukrim
    Mehdi Serairi
    Annals of Operations Research, 2021, 298 : 375 - 406
  • [44] Schedule execution for two-machine flow-shop with interval processing times
    Matsveichuk, N. M.
    Sotskov, Yu. N.
    Egorova, N. G.
    Lai, T. -C.
    MATHEMATICAL AND COMPUTER MODELLING, 2009, 49 (5-6) : 991 - 1011
  • [45] Two-machine chain-reentrant flow shop with the no-wait constraint
    Amrouche K.
    Boudhar M.
    Sami N.
    Amrouche, Karim (amrouche-karim@hotmail.com), 1600, Inderscience Publishers (14): : 573 - 597
  • [46] Two-machine open shop problem with agreement graph
    Tellache, Nour El Houda
    Boudhar, Mourad
    Yalaoui, Farouk
    THEORETICAL COMPUTER SCIENCE, 2019, 796 : 154 - 168
  • [47] Transporting Jobs Through a Two-Machine Open Shop
    Lushchakova, Irina N.
    Soper, Alan J.
    Strusevich, Vitaly A.
    NAVAL RESEARCH LOGISTICS, 2009, 56 (01) : 1 - 18
  • [48] An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server
    Samarghandi, Hamed
    ElMekkawy, Tarek Y.
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2011, 5 (02) : 111 - 131
  • [49] Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
    Della Croce, Federico
    Grosso, Andrea
    Salassa, Fabio
    JOURNAL OF HEURISTICS, 2021, 27 (1-2) : 159 - 173
  • [50] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hatem Hadda
    Najoua Dridi
    Sonia Hajri-Gabouj
    4OR, 2010, 8 : 87 - 99
12345