Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
The Ordered Open-End Bin-Packing Problem
Operations Research
Production and delivery scheduling problem with time windows
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
| Hi-index | 0.00 |
Consider a company that manufactures perishable goods. The company relies on a third party to deliver goods, which picks up delivery products at regular times. At each delivery time, there is a time window that products can be produced to be delivered at that delivery time. Suppose we have a set of jobs with each job specifying its delivery time, processing time and profit. The company can earn the profit of the job 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 jobs that are not picked will be discarded without penalty. We consider both the single machine case and the parallel and identical machines case. In this article we consider two kinds of profits: (1) arbitrary profit, (2) profit proportional to its processing time. In the first case, we give a fully polynomial time approximation scheme (FPTAS) for a single machine with running time $O(\frac{n^3}{\epsilon})$. In the second case, we give a faster FPTAS for a single machine with running time $O(\frac{n^2}{\epsilon})$. All of our algorithms can be extended to parallel and identical machines with a degradation of performance ratios.