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 条
12345