Minimizing the number of late jobs when the start time of the machine is variable

Han Hoogeveen (1) , Vincent t'Kindt (2)

1 Department of Computer Science [Utrecht]
2 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002

We consider the bicriteria single-machine scheduling problem of minimizing the number of tardy jobs and the cost of starting the machine at time −A. We show that we can find all Pareto optimal points by considering at most O(n^2) values of A, where for a given A value, we use an SPT-based algorithm to find the optimal solution instead of Moore-Hodgson.

Mots clés: Single machine scheduling; Number of late jobs; Pareto optimal points; ϵ-constraint approach

Domaines: Recherche opérationnelle [math.OC]

Han Hoogeveen, Vincent t'Kindt. Minimizing the number of late jobs when the start time of the machine is variable. Operations Research Letters, 2012, 40 (5), pp.353-355. ⟨10.1016/j.orl.2012.05.006⟩. ⟨hal-01003834⟩