Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed KacemNizar SouayahMohamed Haouari — 2012

RAIRO - Operations Research

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed KacemNizar SouayahMohamed Haouari — 2012

RAIRO - Operations Research

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...

Page 1

Download Results (CSV)