One-processor scheduling with symmetric earliness and tardiness penalties
Mathematics of Operations Research
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
Mathematics of Operations Research
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Faster optimal single-row placement with fixed ordering
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The One-Machine Problem with Earliness and Tardiness Penalties
Journal of Scheduling
Machine scheduling with earliness, tardiness and non-execution penalties
Computers and Operations Research
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Theoretical Computer Science
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
Hi-index | 0.00 |
We consider the following single machine just-in-time scheduling problem with earliness and tardiness costs: Given n jobs with processing times, due dates and job weights, the task is to schedule these jobs without preemption on a single machine such that the total weighted discrepancy from the given due dates is minimum.NP-hardness of this problem is well established, but no approximation results are known. Using the gap-technique, we show in this paper that the weighted earliness---tardiness scheduling problem and several variants are extremely hard to approximate: If n denotes the number of jobs and b驴驴 is any given constant, then no polynomial-time algorithm can achieve an approximation which is guaranteed to be at most a factor of O(b n ) worse than the optimal solution unless P驴=驴NP.We also present positive results for two special cases. If the individual processing times and likewise the job weights are similar, i.e., they deviate from each other only by a constant factor, then we obtain constant approximation ratios in pseudopolynomial time. For the second special case, we assume only a constant number of distinct due dates. Then we obtain a pseudopolynomial time exact algorithm using an adaption of a dynamic programming approach introduced by Kolliopoulos and Steiner (Theoretical Computer Science 355:261---273, 2006) for the total weighted tardiness problem.