Coordinated scheduling of production and delivery with production window and delivery capacity constraints

  • Authors:

  • Bin Fu;Yumei Huo;Hairong Zhao

  • Affiliations:

  • Department of Computer Science, University of Texas-Pan American, Edinburg, TX;Department of Computer Science, College of Staten Island, CUNY, New York;Department of Mathematics, Computer Science & Statistics, Purdue University, Hammond, IN

  • Venue:
  • AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.