An efficient synthesis of 2,6-pyridine dimethyl formate happened under the microwave irradiation is proposed. It is noteworthy that some factors influence the product yield such as time, temperature, ratio of reactant...An efficient synthesis of 2,6-pyridine dimethyl formate happened under the microwave irradiation is proposed. It is noteworthy that some factors influence the product yield such as time, temperature, ratio of reactants, and acidity which were discussed. The optimized quantity of 2,6-pyridine dimethyl acid is 10 mmol and methanol is 25 mmol. The yield is up to 95%-96% when using 2 mL 30% sulfuric acid. All products have been characterized by IR and 1H NMR.展开更多
A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively...A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.展开更多
The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an inter...The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.展开更多
This paper addresses the scheduling problem involving batch processing machines, which is Mso known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant...This paper addresses the scheduling problem involving batch processing machines, which is Mso known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant model for the problem under study. Fhrthermore, it enables solutions to the problem instances beyond the capability of exact methods developed so far. In order to alleviate computational burden, the authors propose MIP-based heuristic approaches which balance solution quality and computing time.展开更多
文摘An efficient synthesis of 2,6-pyridine dimethyl formate happened under the microwave irradiation is proposed. It is noteworthy that some factors influence the product yield such as time, temperature, ratio of reactants, and acidity which were discussed. The optimized quantity of 2,6-pyridine dimethyl acid is 10 mmol and methanol is 25 mmol. The yield is up to 95%-96% when using 2 mL 30% sulfuric acid. All products have been characterized by IR and 1H NMR.
基金Supported by the NSF of Henan Province(082300410070)
文摘A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.
基金Supported by the Natural Science Foundation of Henan Province（082300460190） Sponsored by Program for Science and Technology Innovation Talents in Universities of Henan Province.
文摘The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.
文摘This paper addresses the scheduling problem involving batch processing machines, which is Mso known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant model for the problem under study. Fhrthermore, it enables solutions to the problem instances beyond the capability of exact methods developed so far. In order to alleviate computational burden, the authors propose MIP-based heuristic approaches which balance solution quality and computing time.
