An approximation algorithm a2 - 1 with absolute performance ratio 3 / 4 is proposed and the asymptotic performance ratio of a2 - 1 applied to the problem in which machines require prepare times is 2 / 3 . another problem is two parallel machines scheduling to maximize the number of just in time jobs . for this problem we give a polynomial time optional algorithm in the case early penalty is larger or equal to late penalty , and it is proofed to be np - had when early penalty is less than late penalty 第二章所討論的另一個(gè)問題是帶提前和延誤懲罰的兩臺機(jī)排序極大化justintime完工工件數(shù)問題,當(dāng)提前懲罰大于或等于延誤懲罰時(shí),本文提出了該問題的一個(gè)多項(xiàng)式時(shí)間最優(yōu)算法a _ ( 2 - 2 ) ,從而證明了該問題是一個(gè)p問題,當(dāng)提前懲罰小于延誤懲罰時(shí),我們證明了該問題是一個(gè)np難的問題。
In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP-hard problems; since it is unlikely that there can ever be efficient polynomial-time exact algorithms solving NP-hard problems, one settles for polynomial-time sub-optimal solutions.