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) algorithm is given for solving the linear programming problem obtained by relaxing the integrality...

From practice to theory, we introduce a state-of-the-art stream of papers that promotes an inclusive and complementary consideration of both analytical methods and ethical values in Operations Research and Management Sciences (OR/MS). We suggest a perspective according to which the consideration...