相关期刊:《Chemical Research in Chinese Universities》《Acta Mathematicae Applicatae Sinica》《Journal of the Operations Research Society of China》《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》更多>>
supported by the National Natural Science Foundation of China(No.12071417).
In this paper,we consider the problem of semi-online machine covering on three machines with two hierarchies,whose objective is to maximize the minimum machine load.Since there is no online algorithm with bounded comp...
Ordinal online schedule for jobs with similar sizes in on two parallel machines system is considered. Firstly it is proved that the worst case performance ratio of the existing algorithm P2 cannot be improved even if ...
Supported by the National Natural Science Foundation of China (No. 60674071)
This paper investigates the semi-online machine covering problem on three special uniform machines with the known largest size. Denote by sj the speed of each machine, j = 1, 2, 3. Assume 0 〈 s1 = s2 = r 〈 t = s3, a...
The combination of online or semi-online with deterioration jobs has never been researched in scheduling problems. In this paper, two semi-online parallel machine scheduling problems with linear deterioration processi...
National Natural Science Foundation of"China(10271110,60021201);the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE,China
In this paper, we consider the seml-online preemptive scheduling problem with known largest job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time zero) when bot...
Research supported by the Natural Science Foundation of Zhejiang Province (Grant No. Y605316), and Natural Science Foundation of Education Department of Zhejiang Province (Grant No. 20060578).
In this paper, we consider the following semi-online List Model problem with known total size. We are given a sequence of independent jobs with positive sizes, which must be assigned to be processed on machines. No ma...
support by the Teaching and Research Award Program for Outstanding Young Teachers in Higer Education Institutions of MOE,China;by National Natural Science Foundation of China (10271110, 60021201)
This paper investigates preemptive semi-online scheduling problems on m identical parallel machines, where the total size of all jobs is known in advance. The goal is to minimize the maximum machine completion time or...
Project supported by the National Natural Science Foundation of China (Nos. 10271110; 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE; China Project supported by the National Natural Science Foundation of China (Nos. 10271110; 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE; China
Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in...
This paper investigates a preemptive semi-online scheduling problem onm identical parallel machines wherem=2,3. It is assumed that all jobs have their processing times in betweenp andrp (p > 0,r ≥1). The goal is to m...
A micro-flow injection sorbent extraction preconcentration system was combined with a graphite furnace atomic absorption spectrometry that formed an integrated system for the determination of trace amounts of elements...