Abstract
In the research process of sorting problem, on the one hand is the development of the diversity of solving methods, on the other hand is the continuous generation of modern problem model due to the emergence of many practical problems, the basic assumptions of the classical sorting problem has been constantly breakthrough, a large number of modern sorting problems. The problem with time window constraint is studied. The sorting of only one machine workpieces is discussed, this paper designed a 3/2-approximation algorithm, the algorithm complexity is.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
