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 第二章所討論的另一個問題是帶提前和延誤懲罰的兩臺機排序極大化justintime完工工件數(shù)問題,當提前懲罰大于或等于延誤懲罰時,本文提出了該問題的一個多項式時間最優(yōu)算法a _ ( 2 - 2 ) ,從而證明了該問題是一個p問題,當提前懲罰小于延誤懲罰時,我們證明了該問題是一個np難的問題。