We sttidy the problem of scheduling n jobs on m parallel bounded batch machines to minimize the sum of squared machine loads. Each batch contains at most B jobs, and the processing time of a batch is equal to the long...We sttidy the problem of scheduling n jobs on m parallel bounded batch machines to minimize the sum of squared machine loads. Each batch contains at most B jobs, and the processing time of a batch is equal to the longest processing time of the jobs in this batch. We prove this problem to be NP-hard. Furthermore, we present a polynomial time approximation scheme （PTAS） and a fully polynomial time approximation scheme （FPTAS） for this problem.展开更多
We discuss the relationship between the frequency and the growth of H-harmonic functions on the Heisenberg group.Precisely,we prove that an H-harmonic function must be a polynomial if its frequency is globally bounded...We discuss the relationship between the frequency and the growth of H-harmonic functions on the Heisenberg group.Precisely,we prove that an H-harmonic function must be a polynomial if its frequency is globally bounded.Moreover,we show that a class of H-harmonic functions are homogeneous polynomials provided that the frequency of such a function is equal to some constant.展开更多
This paper introduces a generic eigenvalue flow of a parameter family of operators, where the corresponding eigenfunction is continuous in parameters. Then the author applies the result to the study of polynomial grow...This paper introduces a generic eigenvalue flow of a parameter family of operators, where the corresponding eigenfunction is continuous in parameters. Then the author applies the result to the study of polynomial growth L-harmonic functions. Under the assumption that the operator has some weakly conic structures at infinity which is not necessarily unique, a Harnack type uniform growth estimate is obtained.展开更多
文摘We sttidy the problem of scheduling n jobs on m parallel bounded batch machines to minimize the sum of squared machine loads. Each batch contains at most B jobs, and the processing time of a batch is equal to the longest processing time of the jobs in this batch. We prove this problem to be NP-hard. Furthermore, we present a polynomial time approximation scheme （PTAS） and a fully polynomial time approximation scheme （FPTAS） for this problem.
基金supported by National Natural Science Foundation of China(Grant No.11071119)
文摘We discuss the relationship between the frequency and the growth of H-harmonic functions on the Heisenberg group.Precisely,we prove that an H-harmonic function must be a polynomial if its frequency is globally bounded.Moreover,we show that a class of H-harmonic functions are homogeneous polynomials provided that the frequency of such a function is equal to some constant.
文摘This paper introduces a generic eigenvalue flow of a parameter family of operators, where the corresponding eigenfunction is continuous in parameters. Then the author applies the result to the study of polynomial growth L-harmonic functions. Under the assumption that the operator has some weakly conic structures at infinity which is not necessarily unique, a Harnack type uniform growth estimate is obtained.
