Citation
Minimizing the Total Weighted Number of Late Jobs with Late Deliveries in Two-Level Supply Chains. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 447-454, 2007.
Paper
Abstract
Supply chain scheduling is an emerging area of research. We study the upstream supplier’s batch scheduling problem in a supply chain defined by Hall and Potts [1]. The supplier has to manufacture multiple products and deliver them to customers in batches. There is an associated delivery cost with each batch. The objective of the supplier is to minimize the sum of the weighted number of late jobs and batch delivery costs. Citing technical difficulties in scheduling late jobs for delivery, the authors in [1] gave a pseudopolynomial solution for the version of the problem where only early jobs get delivered. We present a dynamic programming algorithm with pseudopolynomial complexity that also schedules the late jobs for delivery. This proves that the problem is NP-hard only in the ordinary sense.
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-447-454-P, author = {G. Steiner and R. Zhang},
title = {Minimizing the Total Weighted Number of Late Jobs with Late Deliveries in Two-Level Supply Chains},
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 = {447--454},
note = {Paper},
abstract = {Supply chain scheduling is an emerging area of research. We study the upstream supplier’s batch scheduling problem in a supply chain defined by Hall and Potts [1]. The supplier has to manufacture multiple products and deliver them to customers in batches. There is an associated delivery cost with each batch. The objective of the supplier is to minimize the sum of the weighted number of late jobs and batch delivery costs. Citing technical difficulties in scheduling late jobs for delivery, the authors in [1] gave a pseudopolynomial solution for the version of the problem where only early jobs get delivered. We present a dynamic programming algorithm with pseudopolynomial complexity that also schedules the late jobs for delivery. This proves that the problem is NP-hard only in the ordinary sense.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-447-454-P.pdf} }