A cutting plane algorithm for the single machine scheduling problem with release times

G.L. Nemhauser, M.W.P. Savelsbergh

Research output: Book/ReportReportAcademic

87 Downloads (Pure)

Abstract

We propose a mixed integer programming formulation for the single machine scheduling problem with release times and the objective of minimizing the weighted sum of the start times. The basic formulation involves start time and sequence determining variables, and lower bounds on the start times. Its linear programming relaxation solves problems in which all release times are equal. For the general problem, good lower bounds are obtained by adding additional valid inequalities that are violated by the solution to the linear programming relaxation. We report computational results and suggest some modifications based on including additional variables that are likely to give even better results.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages21
Publication statusPublished - 1991

Publication series

NameMemorandum COSOR
Volume9105
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'A cutting plane algorithm for the single machine scheduling problem with release times'. Together they form a unique fingerprint.

Cite this