Near-optimal solutions of large-scale Single Machine Scheduling Problems

We present a lagrangean heuristic based on the time-indexed formulation of the Single Machine Scheduling Problem with Release Dates. We observe that lagrangian relaxation of job constraints leads to a Weighted Stable Set problem on an Interval Graph. The problem is polynomially solvable by a dynamic programming algorithm. Computational experience is reported on instances up to 400 jobs and maximum processing time 50.

Citation

Technical Report DIIMA - Università di Salerno, May 2002