Citation
A Branch-and-bound Algorithm For Single Machine Total Tardiness Problem With Release Dates. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 162-168, 2005.
Paper
Abstract
This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the performance of one of the algorithms in the literature. These preliminary results show that the proposed approach is very promising as an efficient and effective exact algorithm for the problem.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-162-168-P, author = {C. Oguz and E. Yucel.},
title = {A Branch-and-bound Algorithm For Single Machine Total Tardiness Problem With Release Dates},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {162--168},
note = {Paper},
abstract = {This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the performance of one of the algorithms in the literature. These preliminary results show that the proposed approach is very promising as an efficient and effective exact algorithm for the problem.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-162-168-P.pdf} }