A Zero-Inventory Production-Distribution Problem with Time-Window Constraints. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 428-444, 2005.
Paper
In this paper, we study a sub-problem of integrated production and distribution for a perishable product that cannot be inventoried. The manufacturing facility has a limited production rate, and the delivery truck has a non-negligible traveling time between locations. The order in which customers may receive deliveries is fixed. Each customer requests a delivery quantity and a time window for receiving the delivery. Since the production facility and the shipping trucks are limited resources, not all the customers may receive the delivery within their specified time windows. The problem is then to choose a subset of customers from the given sequence to receive the deliveries to maximize the amount of demand satisfied without violating the product lifetime, the production capacity, and the delivery time window constraints. The general version of the problem is NP-hard even with relaxed time windows and instantaneous truck traveling time. We analyze the properties of this problem and show the conditions under which optimality is achieved. A greedy heuristic is proposed based on this analysis. Empirical observations on the error gaps achieved by this heuristic are reported.
You can download the pdf of this publication from here
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
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.
@INPROCEEDINGS{2005-428-444-P, author = {R. Armstrong and L. Lei and S. Gao},
title = {A Zero-Inventory Production-Distribution Problem with Time-Window Constraints},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {428--444},
note = {Paper},
abstract = {In this paper, we study a sub-problem of integrated production and distribution for a perishable product that cannot be inventoried. The manufacturing facility has a limited production rate, and the delivery truck has a non-negligible traveling time between locations. The order in which customers may receive deliveries is fixed. Each customer requests a delivery quantity and a time window for receiving the delivery. Since the production facility and the shipping trucks are limited resources, not all the customers may receive the delivery within their specified time windows. The problem is then to choose a subset of customers from the given sequence to receive the deliveries to maximize the amount of demand satisfied without violating the product lifetime, the production capacity, and the delivery time window constraints. The general version of the problem is NP-hard even with relaxed time windows and instantaneous truck traveling time. We analyze the properties of this problem and show the conditions under which optimality is achieved. A greedy heuristic is proposed based on this analysis. Empirical observations on the error gaps achieved by this heuristic are reported.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-428-444-P.pdf} }