A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

被引：2
|
作者：
Nessah, Rabia [1 ]
Yalaoui, Farouk [1 ]
Chu, Chengbin [1 ]
机构：
[1] Univ Technol Troyes, Inst Charles Delaunay, OSI, CNRS FRE 28248, F-10010 Troyes, France
来源：
2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS | 2006年
关键词：
identical parallel machine; scheduling; release dates; lower bound; dominance properties; branch and bound;
D O I：
10.1109/ICSSSM.2006.320678
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
In this paper, we consider an identical parallel machine scheduling problem with release dates. The objective is to minimize the total weighted completion time. This problem is know to be strongly NP-hard. We propose two lower bounds. We present an efficient heuristic, we also propose some dominance properties. A branch and bound algorithm in which the heuristic, the lower bounds and the dominance properties are incorporated is proposed and tested on a large set of randomly generated instances.
引用
收藏
页码：1192 / 1198
页数：7
相关论文
共 50 条
  • [41] A flowshop scheduling algorithm to minimize total weighted completion time
    Zhao, CL
    Zhang, QL
    Tang, HY
    PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 1485 - 1488
  • [42] Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardiness
    Beldar, Pedram
    Moghtader, Milad
    Giret, Adriana
    Ansaripoor, Amir Hossein
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 168
  • [43] Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
    Rault, Tifenn
    Sadi, Faiza
    Billaut, Jean-Charles
    Soukhal, Ameur
    JOURNAL OF SCHEDULING, 2024, 27 (05) : 485 - 505
  • [44] Scheduling open shops with parallel machines to minimize total completion time
    Naderi, B.
    Ghomi, S. M. T. Fatemi
    Aminnayeri, M.
    Zandieh, M.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (05) : 1275 - 1287
  • [45] A LAGRANGEAN BASED BRANCH AND BOUND ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH PRECEDENCE CONSTRAINTS TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
    POTTS, CN
    MANAGEMENT SCIENCE, 1985, 31 (10) : 1300 - 1311
  • [46] Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
    Nessah, Rabia
    Kacem, Imed
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 471 - 478
  • [47] Minimizing time-dependent total completion time on parallel identical machines
    Gawiejnowicz, S
    Kurc, W
    Pankowska, L
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 89 - 96
  • [48] Heuristics to minimize the completion time variance of jobs on a single machine and on identical parallel machines
    Rajkanth, Raju
    Rajendran, Chandrasekharan
    Ziegler, Hans
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2017, 88 (5-8): : 1923 - 1936
  • [49] Heuristics to minimize the completion time variance of jobs on a single machine and on identical parallel machines
    Raju Rajkanth
    Chandrasekharan Rajendran
    Hans Ziegler
    The International Journal of Advanced Manufacturing Technology, 2017, 88 : 1923 - 1936
  • [50] Minimizing job completion time variance for service stability on identical parallel machines
    Li, Xueping
    Chen, Yuerong
    Sun, Yang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (04) : 729 - 738
12345