This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize the weighted number of late jobs. An O (n log n) ...

Research from all publishers Recent studies have made significant strides in applying optimised machine learning methods and physics-informed frameworks for dynamic load identification.

We consider the scheduling problem in which jobs with release dates and delivery times are to be scheduled on one machine. We present a 4/3-approximation algorithm for the problem with precedence ...