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

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 metadatas

https://hal-univ-tours.archives-ouvertes.fr/hal-01003834
Contributor : Vincent t'Kindt <>
Submitted on : Tuesday, June 10, 2014 - 5:23:19 PM
Last modification on : Tuesday, August 13, 2019 - 10:16:02 AM

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

94