This paper addresses a class of single-machine scheduling problems with a common due-date for all jobs, and general earliness and tardiness costs. We show that a class of simple, polynomial, "greedy-type" heuristics can be used to generate close-to-optimal schedules. An extensive numerical study exhibits small optimality gaps. For convex cost structures, we establish that the worst-case optimality gap is bounded by e-i ≈ 0.36, if the due-date is non-restrictive.
- Deterministic scheduling
- General earliness and tardiness costs
- Greedy heuristics
- Worst-case optimality gaps