In order to realize seedbed mechanization of whole plastic-film mulching on double ridges and to overcome the difficulty in crosswise belt type soil covering by whole plastic-film,a kind of crosswise belt type whole p...In order to realize seedbed mechanization of whole plastic-film mulching on double ridges and to overcome the difficulty in crosswise belt type soil covering by whole plastic-film,a kind of crosswise belt type whole plastic-film ridging-mulching corn seeder on double ridges was designed in this study.The key components of the sample machine was designed and its working parameters of seedbed soil covering device,crosswise-belt soil covering mechanism and profiling sowing depth adjustment device were determined.After numerical simulation on the film edge and crosswise soil covering by whole plastic-film on double ridges by discrete element method,the velocity and displacement of the oscillating plate,and the variation rule of amount of covered soil with time were explored.Field test results show that,when the advancing velocity of the machine was 0.50 m/s,the qualified rate of soil width covered on film edge of the seedbed reached 96.1%,qualified rate of crosswise soil belt width was 94.5%,qualified rate of soil thickness on seedbed was 95.3%,qualified rate of sowing depth was 89.3%,qualified rate of spacing between crosswise soil belts reached 93.6%,which all met related standards in China and satisfied design requirements,and could realize seedbed mechanization of whole plastic-film mulching on double ridges.Comparison tests on working performances of practical soil covering show a basic consistence with the seedbed soil covering simulation,and verified the effectiveness of the soil covering model built by using discrete element method.展开更多
In this paper, we investigate the/-preemptive scheduling on parallel machines to maximize the minimum machine completion time, i.e., machine covering problem with limited number of preemptions. It is aimed to obtain t...In this paper, we investigate the/-preemptive scheduling on parallel machines to maximize the minimum machine completion time, i.e., machine covering problem with limited number of preemptions. It is aimed to obtain the worst case ratio of the objective value of the optimal schedule with unlimited preemptions and that of the schedule allowed to be preempted at most i times. For the m identical machines case, we show the worst case ratio is 2m-i-1/m and we present a polynomial time algorithm which can guarantee the ratio for any 0 〈 i 〈2 m - 1. For the /-preemptive scheduling on two uniform machines case, we only need to consider the cases of i = 0 and i = 1. For both cases, we present two linear time algorithms and obtain the worst case ratios with respect to s, i.e., the ratio of the speeds of two machines.展开更多
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...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, and let s = t/r be the speed ratio. An algorithm with competitive ratio max（2, 3s＋6/s＋6 is presented. We also show the lower bound is at least max（2, 38 3s/s＋6）. For s ≤ 6, the algorithm is an optimal algorithm with the competitive ratio 2. Besides, its overall competitive ratio is 3 which matches the overall lower bound. The algorithm and the lower bound in this paper improve the results of Luo and Sun.展开更多
基金The authors acknowledge that this work was financially supported by National Natural Science Foundation of China(Grant No.51775115No.51405086)China Agriculture Research System(CARS-14-1-28).
文摘In order to realize seedbed mechanization of whole plastic-film mulching on double ridges and to overcome the difficulty in crosswise belt type soil covering by whole plastic-film,a kind of crosswise belt type whole plastic-film ridging-mulching corn seeder on double ridges was designed in this study.The key components of the sample machine was designed and its working parameters of seedbed soil covering device,crosswise-belt soil covering mechanism and profiling sowing depth adjustment device were determined.After numerical simulation on the film edge and crosswise soil covering by whole plastic-film on double ridges by discrete element method,the velocity and displacement of the oscillating plate,and the variation rule of amount of covered soil with time were explored.Field test results show that,when the advancing velocity of the machine was 0.50 m/s,the qualified rate of soil width covered on film edge of the seedbed reached 96.1%,qualified rate of crosswise soil belt width was 94.5%,qualified rate of soil thickness on seedbed was 95.3%,qualified rate of sowing depth was 89.3%,qualified rate of spacing between crosswise soil belts reached 93.6%,which all met related standards in China and satisfied design requirements,and could realize seedbed mechanization of whole plastic-film mulching on double ridges.Comparison tests on working performances of practical soil covering show a basic consistence with the seedbed soil covering simulation,and verified the effectiveness of the soil covering model built by using discrete element method.
基金Supported by the National Natural Science Foundation of China(11001242,11071220)
文摘In this paper, we investigate the/-preemptive scheduling on parallel machines to maximize the minimum machine completion time, i.e., machine covering problem with limited number of preemptions. It is aimed to obtain the worst case ratio of the objective value of the optimal schedule with unlimited preemptions and that of the schedule allowed to be preempted at most i times. For the m identical machines case, we show the worst case ratio is 2m-i-1/m and we present a polynomial time algorithm which can guarantee the ratio for any 0 〈 i 〈2 m - 1. For the /-preemptive scheduling on two uniform machines case, we only need to consider the cases of i = 0 and i = 1. For both cases, we present two linear time algorithms and obtain the worst case ratios with respect to s, i.e., the ratio of the speeds of two machines.
基金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, and let s = t/r be the speed ratio. An algorithm with competitive ratio max（2, 3s＋6/s＋6 is presented. We also show the lower bound is at least max（2, 38 3s/s＋6）. For s ≤ 6, the algorithm is an optimal algorithm with the competitive ratio 2. Besides, its overall competitive ratio is 3 which matches the overall lower bound. The algorithm and the lower bound in this paper improve the results of Luo and Sun.
