Minimizing the number of late jobs when the start time of the machine is variable - Archive ouverte HAL Access content directly
Journal Articles Operations Research Letters Year : 2012

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

(1) , (2)
1
2

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.
Not file

Dates and versions

hal-01003834 , version 1 (10-06-2014)

Identifiers

Cite

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⟩
49 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More