Citation
Sequencing a Single Machine with Due Dates and Deadlines: an ILP-based Approach to Solve Very Large Instances. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 71-79, 2007.
Paper
Abstract
We consider the problem of minimizing the weighted number of tardy jobs on a single machine where each job is also subject to a deadline that cannot be violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure, that allows to solve to optimality instances with up to 30,000 jobs in size.
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{2007-071-079-P, author = {P. Baptiste and F. Della Croce and A. Grosso and V. T’kindt},
title = {Sequencing a Single Machine with Due Dates and Deadlines: an ILP-based Approach to Solve Very Large Instances},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {71--79},
note = {Paper},
abstract = {We consider the problem of minimizing the weighted number of tardy jobs on a single machine where each job is also subject to a deadline that cannot be violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure, that allows to solve to optimality instances with up to 30,000 jobs in size.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-071-079-P.pdf} }