Skip to Main content Skip to Navigation

Ordonnancement sur machines parallèles: minimiser la somme des coûts.

Abstract : We study four parallelmachines scheduling problems. These problems are different by the criterion to minimize : the total completion time, the total weighted completion time, the total tardiness or the total weighted tardiness. Jobs can not be processed before release dates and preemption is forbidden. We have proposed several dominance rules for these problems. A complete study of lower bounds, existing and new ones, is also provided.
Finally, we have presented a Branch&Bound method to solve exactly those problems, which takes advantage of lower bounds and dominance rules.
Document type :
Complete list of metadata
Contributor : David Savourey Connect in order to contact the contributor
Submitted on : Thursday, June 21, 2007 - 9:57:11 AM
Last modification on : Tuesday, November 16, 2021 - 4:30:55 AM
Long-term archiving on: : Thursday, April 8, 2010 - 8:57:17 PM


  • HAL Id : tel-00156405, version 1


David Savourey. Ordonnancement sur machines parallèles: minimiser la somme des coûts.. Modélisation et simulation. Université de Technologie de Compiègne, 2006. Français. ⟨tel-00156405⟩



Record views


Files downloads