Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Rabia Nessah () and Imed Imed Kacem ()
Additional contact information
Imed Imed Kacem: Université Paul Verlaine, Metz

No 2010-ECO-08, Working Papers from IESEG School of Management

Keywords: Scheduling; Single machine; Release dates; Lower bounds; Splitting; Total weighted completion time (search for similar items in EconPapers)
Pages: 24 pages
Date: 2009-01
References: Add references at CitEc
Citations:

Downloads: (external link)
http://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich= ... -08_Nessah_Kacem.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 403 FORBIDDEN (http://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich=54246261_2010-ECO-08_Nessah_Kacem.pdf [301 Moved Permanently]--> https://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich=54246261_2010-ECO-08_Nessah_Kacem.pdf [301 Moved Permanently]--> https://iesegnet.sharepoint.com/sites/Intranet-Home/bienvenue/DownloadDoc.asp?Fich=54246261_2010-ECO-08_Nessah_Kacem.pdf)

Related works:
Working Paper: Branch and bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (2012)
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:ies:wpaper:e201008

Access Statistics for this paper

More papers in Working Papers from IESEG School of Management Contact information at EDIRC.
Bibliographic data for series maintained by Lies BOUTEN ().