Title of article
Integrated production and delivery scheduling with disjoint windows Original Research Article
Author/Authors
Yumei Huo، نويسنده , , Joseph Y.-T. Leung، نويسنده , , Xin Wang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
11
From page
921
To page
931
Abstract
Consider a company that manufactures perishable goods. The company relies on a third party to deliver goods, which picks up delivery products at regular or irregular times. At each delivery time, there is a time window that products can be produced to be delivered at that delivery time. The time windows are disjoint. Suppose we have a set of jobs with each job specifying its delivery time, processing time and profit. The company can earn the profit if the job is produced and delivered at its specified delivery time. From the company point of view, we are interested in picking a subset of jobs to produce and deliver so as to maximize the total profit. The unpicked jobs will be discarded without penalty. We consider both the single machine case and the parallel and identical machine case.
Keywords
Single machine , Perishable goods , NP-hard and strongly NP-hard , Fully polynomial time approximation schemes , Parallel and identical machines
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887407
Link To Document