A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 violateddoi:10.1007/978-3-642-77489-8_4 fatcat:kev7eo5mnnbmrnnoxqytmb7va4