Citation
Batching and Scheduling with Tardiness. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 291-300, 2009.
Paper
Abstract
In this paper, we address batching and scheduling a single production system minimizing tardiness penalties. We define the optimal batching problem and scheduling problem, which is an integrated lot-splitting and scheduling problem. We examine the structural properties of the optimal solution and present some theoretical results. Using these results, an efficient dynamic programming algorithm is proposed.
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-291-300-P, author = {O. Hazir and S. Kedad-Sidhoum and P. Chretienne},
title = {Batching and Scheduling with Tardiness},
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 = {291--300},
note = {Paper},
abstract = {In this paper, we address batching and scheduling a single production system minimizing tardiness penalties. We define the optimal batching problem and scheduling problem, which is an integrated lot-splitting and scheduling problem. We examine the structural properties of the optimal solution and present some theoretical results. Using these results, an efficient dynamic programming algorithm is proposed.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-291-300-P.pdf} }