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.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.