A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates

被引：1
|
作者：
Rakrouki, Mohamed Ali [1 ,3 ]
Ladhari, Talel [2 ,3 ]
机构：
[1] Econ & Gest Jendouba, Fac Sci Jurid, Jendouba, Tunisia
[2] Ecole Superieure Sci Econom & Commerciales, Tunis, Tunisia
[3] Unite recherche ROI, Ecole Polytechn Tunisie, La Marsa, Tunisia
来源：
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词：
Branch-and-bound; flowshop; release dates; total flowtime; SHOP PROBLEM; SCHEDULING PROBLEMS;
D O I：
10.1109/ICCIE.2009.5223879
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. We present several variants of a branch-and-bound algorithm for the problem under consideration. Computational experiments on a large set of randomly generated instances show that problems up to 30 (70, and 100) job problems when release dates are uniformly distributed in the [1, 100] and [1, 200] ([1, 100n], [1, 200n]) range can be solved in a reasonable CPU time.
引用
收藏
页码：80 / +
页数：3
相关论文
共 50 条
  • [31] AN EXACT ALGORITHM MINIMIZING THE MAKESPAN FOR THE TWO-MACHINE FLOWSHOP SCHEDULING UNDER RELEASE DATES AND BLOCKING CONSTRAINTS
    Amdouni, Hajer
    Jemmali, Mahdi
    Mrad, Mehdi
    Ladhari, Talel
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2021, 28 (06): : 631 - 643
  • [32] Branch and Bound algorithm for solving blocking flowshop scheduling problem with total completion time
    Toumi, Said
    Jarboui, Bassem
    Eddaly, Mansour
    Rebai, Abdelwaheb
    2013 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2013, : 746 - 749
  • [33] A new lower bound for minimising the total completion time in a two-machine flow shop under release dates
    Chalghoumi, Sabrine
    Mrad, Mehdi
    Ladhari, Talel
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [34] A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents
    Lee, Wen-Chiung
    Wang, Jen-Ya
    Lin, Mei-Chun
    KNOWLEDGE-BASED SYSTEMS, 2016, 105 : 68 - 82
  • [35] A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
    Ng, C. T.
    Wang, J. -B.
    Cheng, T. C. E.
    Liu, L. L.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (01) : 83 - 90
  • [36] A BRANCH-AND-BOUND ALGORITHM TO MINIMIZE TOTAL TARDINESS WITH DIFFERENT RELEASE DATES
    CHU, CB
    NAVAL RESEARCH LOGISTICS, 1992, 39 (02) : 265 - 283
  • [37] MINIMIZING TOTAL COMPLETION TIME IN A TWO-MACHINE NO-WAIT FLOWSHOP WITH UNCERTAIN AND BOUNDED SETUP TIMES
    Allahverdi, Muberra
    Allahverdi, Ali
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2020, 16 (05) : 2439 - 2457
  • [38] Minimizing makespan in a two-machine flowshop scheduling with batching and release time
    Tang, Lixin
    Liu, Peng
    MATHEMATICAL AND COMPUTER MODELLING, 2009, 49 (5-6) : 1071 - 1077
  • [39] A branch-and-bound algorithm for the permutation flow shop scheduling problem subject to release dates and delivery times
    Ladhari, Talel
    Haouari, Mohamed
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1167 - 1171
  • [40] Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
    Aydilek, Harun
    Allahverdi, Ali
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 59 (02) : 684 - 693
12345