Heuristics for the Early/tardy Scheduling Problem with Release Dates


In this paper we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search heuristic. The dispatch rules use a lookahead parameter whose value must be specified. We perform some… (More)


7 Figures and Tables

Slides referencing similar topics