Abstract
Sorting problem has been one of classical combinatorial optimization problems, which has been widely applied in production and manufacturing fields in recent decades. This paper studies scheduling problem with time window constraint which can be regarded as a new resource constraint model which has potential applications in flexible manufacturing systems and printed circuit board components. However, in order to discuss integrality, this paper introduces scheduling problem of single machine with time window. SPWS and 3/2 approximation algorithms are designed respectively.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call