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 条
  • [21] Coordinating scheduling with batch deliveries in a two-machine flow shop
    Jason Chao-Hsien Pan
    Chih-Lun Wu
    Han-Chiang Huang
    Chi-Shiang Su
    The International Journal of Advanced Manufacturing Technology, 2009, 40 : 607 - 616
  • [22] Outsourcing and scheduling for a two-machine flow shop with release times
    Ahmadizar, Fardin
    Amiri, Zeinab
    ENGINEERING OPTIMIZATION, 2018, 50 (03) : 483 - 498
  • [23] Two-machine chain-reentrant flow shop with the no-wait constraint
    Amrouche, Karim
    Boudhar, Mourad
    Sami, Nazim
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2020, 14 (04) : 573 - 597
  • [24] Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
    Khorasanian, Danial
    Moslehi, Ghasem
    COMPUTERS & OPERATIONS RESEARCH, 2017, 79 : 94 - 108
  • [25] Minimising the makespan in the two-machine job shop problem under availability constraints
    Benttaleb, Mourad
    Hnaien, Faicel
    Yalaoui, Farouk
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (05) : 1427 - 1457
  • [26] Two-machine job shop problem for makespan minimization under availability constraint
    Benttaleb, Mourad
    Hnaien, Faicel
    Yalaoui, Farouk
    IFAC PAPERSONLINE, 2016, 49 (28): : 132 - 137
  • [27] Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures
    Kim, Byung-Gyoo
    Choi, Byung-Cheon
    Park, Myoung-Ju
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2017, 34 (04)
  • [28] Heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization
    Benttaleb, Mourad
    Hnaien, Faicel
    Yalaoui, Farouk
    IFAC PAPERSONLINE, 2018, 51 (11): : 1065 - 1070
  • [29] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Ji-Bo Wang
    P. Ji
    T. C. E. Cheng
    Dan Wang
    Optimization Letters, 2012, 6 : 1393 - 1409
  • [30] Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop
    Jafari, A. A.
    Zare, H. Khademi
    Lotfi, M. M.
    Tavakkoli-Moghaddam, R.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2016, 29 (06): : 778 - 787
12345