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

Rabia Nessah (), Farouk Yalaoui () and C. Chu ()
Additional contact information
Farouk Yalaoui: LOSI - Laboratoire d'Optimisation des Systèmes Industriels - ICD - Institut Charles Delaunay - UTT - Université de Technologie de Troyes - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Published in Computers and Operations Research, 2008, 35 (4), pp.1176-1190

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00580602

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().