Constraint single machine scheduling problem with time window

The combinatorial optimization, algorithmic graph theory, and approximate algorithm theory were not developed by one person, but through the joint efforts of several generations. By the early 1970s or so, the view had taken shape that the algorithms that would work in practice were usually those implemented in polynomial time. Searching for efficient algorithms for all kinds of problems inspired computer experts and some mathematicians of the time. We design a 3/2-approximation algorithm to solve the sorting problem of parallel machine parts with time Windows.