Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints

• Published in: Algorithmic Aspects in Information and Management Vol. 6124; pp. 141 - 149
• Main Authors: Fu, Bin, Huo, Yumei, Zhao, Hairong
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 2010; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Delivery Time; Feasible Schedule; Polynomial Time Approximation Scheme; Production Schedule; Schedule Problem
• ISBN: 9783642143540; 3642143547
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-14355-7_15

This paper considers the coordinated production and delivery scheduling problem. We have a planning horizon consisting of z delivery times each with a unique delivery capacity. Suppose we have a set of jobs each with a committed delivery time, processing time, production window, and profit. The company can earn the profit if the job is produced in its production window and delivered before its committed delivery time. From the company point of view, we are interested in picking a subset of jobs to process and deliver so as to maximize the total profit subject to the delivery capacity constraint. We consider both the single delivery time case and the multiple delivery times case. Suppose the given set of jobs are k-disjoint, that is, the jobs can be partitioned into k lists of jobs such that the jobs in each list have disjoint production windows. When k is a constant, we developed a PTAS for the single delivery case. For multiple delivery times case, we also develop a PTAS when the number of delivery times is a constant as well.