Citation
Single machine scheduling with delivery dates and cumulative payoffs. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 261-274, 2011.
Paper
Abstract
We address a scheduling problem with a new criterion and unequal release dates. This new criterion results from a practical situation in the domain of book digitization. Given a set of job-independent delivery dates, the goal is to maximize the cumulative number of jobs processed before each delivery date. We establish the complexity of the general problem. In addition, we provide a pseudopolynomial time algorithm for the two delivery dates case based on dynamic programming, and we discuss some polynomial cases.
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{2011-261-274-P, author = {Y. Seddik and C. Gonzales and S. Kedad-Sidhoum},
title = {Single machine scheduling with delivery dates and cumulative payoffs},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {261--274},
note = {Paper},
abstract = {We address a scheduling problem with a new criterion and unequal release dates. This new criterion results from a practical situation in the domain of book digitization. Given a set of job-independent delivery dates, the goal is to maximize the cumulative number of jobs processed before each delivery date. We establish the complexity of the general problem. In addition, we provide a pseudopolynomial time algorithm for the two delivery dates case based on dynamic programming, and we discuss some polynomial cases.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-261-274-P.pdf} }