Record number :
Title of article :
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
Author/Authors :
Artigues، نويسنده , , Christian and Jozefowiez، نويسنده , , Nicolas and Aloulou، نويسنده , , Mohamed Ali، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Pages :
From page :
To page :
Abstract :
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both objectives, the maximum lateness one-machine problem is also NP-hard but efficiently solved by Carlierʹs algorithm while the unit family setup cost one machine-problem with two families can be solved in polynomial timeby Darteʹs algorithm, even when precedence constraints are considered. Under the ϵ-constraint framework we propose a branch-and-bound method to minimize the first objective with a given upper bound on the second.
Keywords :
bi-objective one-machine scheduling , unit family setup costs , maximum lateness , Branch-and-bound
Journal title :
Electronic Notes in Discrete Mathematics
Link To Document :