Citation
Integrated batch sizing and scheduling on a single machine. Journal of Scheduling, 14 (6): 541-555, 2011.
Selected
Abstract
In this paper, we address the integrated batch sizing and scheduling problem. We consider a single machine which can handle at most one customer order at a time and for which the nominal production rate is the same for all the customer orders. Demand is deterministic, and all the orders are ready to be processed at time zero and must be delivered at a given due date. Each order can be satisfied from different batches. Upper and lower bounds on the size of the batches are considered. We seek a feasible schedule that minimizes the sum of the tardiness costs and the setup costs incurred by creating a new batch. We present some structural properties of the optimal schedules for both single-order and multipleorder problems and then propose dynamic programming algorithms based on these properties. Computational results that show the efficiency of the method are reported.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-011-0229-x You can link directly to the original paper, via the doi, from here
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
@ARTICLE{2011-541-555-SI, author = {P. Chrétienne and Ö. Haz?r and S. Kedad-Sidhoum},
title = {Integrated batch sizing and scheduling on a single machine},
journal = {Journal of Scheduling},
year = {2011},
volume = {14},
pages = {541--555},
number = {6},
note = {Selected},
abstract = {In this paper, we address the integrated batch sizing and scheduling problem. We consider a single machine which can handle at most one customer order at a time and for which the nominal production rate is the same for all the customer orders. Demand is deterministic, and all the orders are ready to be processed at time zero and must be delivered at a given due date. Each order can be satisfied from different batches. Upper and lower bounds on the size of the batches are considered. We seek a feasible schedule that minimizes the sum of the tardiness costs and the setup costs incurred by creating a new batch. We present some structural properties of the optimal schedules for both single-order and multipleorder problems and then propose dynamic programming algorithms based on these properties. Computational results that show the efficiency of the method are reported.},
doi = {10.1007/s10951-011-0229-x},
owner = {user},
timestamp = {2012.05.25} }