Sciweavers

Share
ENDM
2010

An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives

8 years 3 months ago
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
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 objevtive with a given upper bound on the second.
Christian Artigues, Nicolas Jozefowiez, Mohamed Al
Added 02 Mar 2011
Updated 02 Mar 2011
Type Journal
Year 2010
Where ENDM
Authors Christian Artigues, Nicolas Jozefowiez, Mohamed Ali Aloulou
Comments (0)
books