Skip to Main content Skip to Navigation
Journal articles

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

Han Hoogeveen 1 Vincent t'Kindt 2 
2 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002
LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours, CNRS - Centre National de la Recherche Scientifique : EMR7002 / ERL7002
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal-univ-tours.archives-ouvertes.fr/hal-01003834
Contributor : Vincent T'Kindt Connect in order to contact the contributor
Submitted on : Tuesday, June 10, 2014 - 5:23:19 PM
Last modification on : Tuesday, May 10, 2022 - 1:44:02 PM

Identifiers

Citation

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

Share

Metrics

Record views

49