相关期刊:《Journal of Computer and Communications》《Journal of Systems Engineering and Electronics》《Journal of Intelligent Learning Systems and Applications》《Tsinghua Science and Technology》更多>>
partially supported by National Key Research and Development Program of China(2018YFB1700200);National Natural Science Foundation of China(61972389,61903356,61803368,U1908212);Youth Innovation Promotion Association of the Chinese Academy of Sciences,National Science and Technology Major Project(2017ZX02101007-004);Liaoning Provincial Natural Science Foundation of China(2020-MS-034,2019-YQ-09);China Postdoctoral Science Foundation(2019M661156)。
Time-sensitive networks(TSNs)support not only traditional best-effort communications but also deterministic communications,which send each packet at a deterministic time so that the data transmissions of networked con...
supported in part by the National Natural Sci-ence Foundation of China(NSFC)under Grant No.71801051.
This paper systematically studies the two machine flow-shop scheduling problems with no-wait and deterministic unavailable interval constraints.To minimize the makespan,three integer programming mathematical models ar...
In this paper, we consider the no-wait two-machine scheduling problem with convex resource allocation and learning effect under the condition of common due date assignment. We take the total earliness, tardiness and c...
National Natural Science Foundations of China(Nos.61174040,61573144,11304200);Shanghai Commission of Science and Technology,China(No.12JC1403400);Shanghai Municipal Education Commission for Training Young Teachers,China(No.ZZSDJ15031);Shanghai Teaching and Reforming Experimental Undergraduate Majors Construction Program,China
Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop sch...
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been inves...
National Natural Science Foundations of China(Nos.61174040,61104178);Shanghai Commission of Science and Technology,China(No.12JC1403400);the Fundamental Research Funds for the Central Universities,China
The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in man...
No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Seve...
Project 60304016 supported by the National Natural Science Foundation of China
No-wait flowshop scheduling problems with the objective to minimize the total flow time is an important se-quencing problem in the field of developing production plans and has a wide engineering background. Genetic al...