Scheduling with Deadlines and Nested Processing Intervals for a Single Machine

  • V. S. Gordon, F. Werner, O. A. Yanushkevich
  • January 2000, Springer Science + Business Media
  • DOI: 10.1007/978-3-642-58300-1_58

What is it about?

The single machine preemptive scheduling problem to minimize the weighted number of late jobs is considered under the assumption that release and due date intervals are nested and certain specified jobs have to be completed on time, that is, some of the due dates are in fact deadlines. Sidney was the first who considered the problem to minimize the number of late jobs in the situation when certain specified jobs have to be on time. Unlike [8], we consider this situation in the case of given release dates and weights of jobs subject to nested release and due date intervals.

Read Publication

The following have contributed to this page: Prof. Dr. Frank Werner