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

作者：Hoogeveen Han^*; T'kindt Vincent

来源：Operations Research Letters, 2012, 40(5): 353-355.

DOI：10.1016/j.orl.2012.05.006

• Single machine scheduling
• Number of late jobs
• Pareto optimal points
• epsilon-constraint approach

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.

• 出版日期2012-9