Branch and Bound Method to Solve Multi Objectives Function
Keyword(s):
This paper presents a branch and bound algorithm for sequencing a set of n independent jobs on a single machine to minimize sum of the discounted total weighted completion time and maximum lateness, this problems is NP-hard. Two lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominance rules were suggested and proved, the problem solved with up to 50 jobs.
2012 ◽
Vol 39
(3)
◽
pp. 471-478
◽
2003 ◽
Vol 31
(6)
◽
pp. 492-496
◽
2008 ◽
Vol 43
(7-8)
◽
pp. 810-821
◽
2015 ◽
Vol 32
(04)
◽
pp. 1550026
◽
2007 ◽
Vol 24
(02)
◽
pp. 245-261
◽
2016 ◽
Vol 44
(5)
◽
pp. 676-679
◽