Citation
An effcient implicit enumeration for scheduling equal-length jobs with release times on a single processor to maximize throughput. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 366-377, 2009.
Paper
Abstract
We suggest an O(n^2 log n) combinatorial algorithm for scheduling n equal length jobs with release times and due dates on a single machine as to minimize the number of late jobs improving the earlier proposed dynamic programming algorithm with the time complexity O(n^5)
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{2009-366-377-P, author = {N. Vakhania},
title = {An effcient implicit enumeration for scheduling equal-length jobs with release times on a single processor to maximize throughput},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {366--377},
note = {Paper},
abstract = {We suggest an O(n^2 log n) combinatorial algorithm for scheduling n equal length jobs with release times and due dates on a single machine as to minimize the number of late jobs improving the earlier proposed dynamic programming algorithm with the time complexity O(n^5)},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-366-377-P.pdf} }