Open AccessSingle machine workpieces sorting problem with time window
Author(s) -
Bihui Cheng
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/768/6/062041
Subject(s) - sorting , sorting network , computer science , constraint (computer aided design) , sorting algorithm , mathematical optimization , process (computing) , algorithm , mathematics , operating system , geometry
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.