Citation
Minimizing the number of tardy jobs in single machine scheduling using MIP. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 227-238, 2009.
Paper
Abstract
This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Pre-emption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how both good-quality lower and upper bounds can be computed. Numerical experiments on Baptiste et al.'s instances are provided, which demonstrate the efficiency of the approach.
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-227-238-P, author = {S. Ourari and C. Briand and B. Bouzouia},
title = {Minimizing the number of tardy jobs in single machine scheduling using MIP},
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 = {227--238},
note = {Paper},
abstract = {This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Pre-emption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how both good-quality lower and upper bounds can be computed. Numerical experiments on Baptiste et al.'s instances are provided, which demonstrate the efficiency of the approach.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-227-238-P.pdf} }