A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (1)
1

Abstract

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
Not file

Dates and versions

hal-02473383 , version 1 (10-02-2020)

Identifiers

Cite

Rabia Nessah, Farouk Yalaoui. A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. 2006 International Conference on Service Systems and Service Management, Oct 2006, Troyes, France. pp.1192-1198, ⟨10.1109/ICSSSM.2006.320678⟩. ⟨hal-02473383⟩

Collections

CNRS UTT LOSI
11 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More