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.
Federgruen, Awi, and Gur Mosheiov. "Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs." Operations Research Letters 16, no. 4 (November 1994): 199-208.
Each author name for a Columbia Business School faculty member is linked to a faculty research page, which lists additional publications by that faculty member.
Each topic is linked to an index of publications on that topic.