This paper presents sufficient conditions for the existence of positive solutions for the fourth-order boundary value problem system with p-Laplacian operator. The existence of single or multiple positive solutions fo...This paper presents sufficient conditions for the existence of positive solutions for the fourth-order boundary value problem system with p-Laplacian operator. The existence of single or multiple positive solutions for the system is showed through the fixed point index theory in cones under some assumptions.展开更多
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.展开更多
In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having...In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having shown that the problem is NP-hard, we put forward three approximation schemes with worst case ratio 4, 2, and 3/2, respectively.展开更多
文摘This paper presents sufficient conditions for the existence of positive solutions for the fourth-order boundary value problem system with p-Laplacian operator. The existence of single or multiple positive solutions for the system is showed through the fixed point index theory in cones under some assumptions.
文摘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.
文摘In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having shown that the problem is NP-hard, we put forward three approximation schemes with worst case ratio 4, 2, and 3/2, respectively.
