Using Lagrangean Relaxation to Minimize the ( Weighted ) Number of Late Jobs on a Single Machine

@inproceedings{Sevaux1999UsingLR,
  title={Using Lagrangean Relaxation to Minimize the ( Weighted ) Number of Late Jobs on a Single Machine},
  author={Marc Sevaux},
  year={1999}
}
This paper tackles the general single machine scheduling problem, where jobs have di erent release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is rst introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original… CONTINUE READING