检索结果-南通市图书馆

Pareto Minimizing Total Completion Time and Maximum Cost with Positional Due Indices

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2015年第3期3卷 381-387页

作者： yuan Gao jin-jiang yuan School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China

In this paper,we study the Pareto optimization scheduling problem on a single machine with positional due indices of jobs to minimize the total completion time and a maximum *** this problem,we give two O(n^(4))-time ... 详细信息

关键词： Scheduling Pareto optimization Maximum cost Positional due indices

Simultaneous Approximation Ratios for Parallel Machine Scheduling Problems

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2019年第3期7卷 485-500页

作者： Long Wan jin-jiang yuan School of Information Technology Jiangxi University of Financeand EconomicsNanchang 310013China School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China

Motivated by the problem to approximate all feasible schedules by one schedule in a given scheduling environment,we introduce in this paper the concepts of strong simultaneous approximation ratio and weak simultaneous approximation *** we study the two variants under various scheduling environments,such as non-preemptive,preemptive or fractional scheduling on identical,related or unrelated machines.

关键词： Scheduling Simultaneous approximation ratio Global fairness

Task-assignment problem;Ternary variables;Binary variables;Mixed integer programming problem

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2016年第1期4卷 111-119页

作者： Ran Ma jin-jiang yuan School of Mathematics and Information Science Henan Polytechnic UniversityJiaozuo 454000HenanChina School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China

We consider the online scheduling with job rejection to minimize the total weighted completion time of the scheduled jobs plus the total rejection penalty of the rejected *** the problem,a set of independent jobs arriving online over time has to be scheduled with the flexibility of rejecting some of the jobs,where preemption is not allowed and the information of each job,including its processing time,release date,weight,and rejection penalty,is not known in *** this problem,using a technique named Greedy-Interval-Rejection,we provide an online algorithm with a competitive ratio of at most 4+εon identical machines and an online algorithm with a competitive ratio of at most 8 on unrelated machines,respectively。

关键词： Scheduling Online algorithms Total weightedc ompletion time Rejection

Equivalence of Some Different Maintenance Activities in Single-Machine Scheduling

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2018年第4期6卷 545-556页

作者： Juan Zou jin-jiang yuan School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China School of Mathematical Sciences Qufu Normal UniversityQufu 273165ShandongChina

We study single-machine scheduling problems with a single maintenance activity(MA)of length p0 under three types of assumptions:(A)the MA is required in a fixed time interval[T−p0,T]with T≥p0 and the job processing is of preemptive and resumable;(B)the MA is required in a relaxed time interval[0,T]with T≥p0 and the job processing is of nonpreemptive;(C)the MA is required in a relaxed time interval[T0,T]with 0≤T0≤T−p0 and the job processing is of *** show in this paper that,up to the time complexity for solving scheduling problems,assumptions(A)and(B)are equivalent,and moreover,if T−(T0+p0)is greater than or equal to the maximum processing time of all jobs,the assumption(C)is also equivalent to(A)and(B).As an application,we study the scheduling for minimizing the weighted number of tardy jobs under the above three assumptions,respectively,and present corresponding time-complexity results.

关键词： Scheduling Maintenance Dynamic programming

PM-compact Graphs and Vertex-deleted Subgraphs

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2022年第4期38卷 955-965页

作者： Yi-pei ZHANG Xiu-mei WANG jin-jiang yuan School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China

The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings of G.A graph G is PM-compact if the 1-skeleton graph of the prefect matching polytope of G is ***,a matchable graph G is PM-compact if and only if for each even cycle C of G,G-V(C)has at most one perfect *** paper considers the class of graphs from which deleting any two adjacent vertices or nonadjacent vertices,respectively,the resulting graph has a unique perfect *** PM-compact graphs in this class of graphs are presented.

关键词： perfect matching nice cycle bicritical graph PM-compact graph

A Characterization of PM-compact Hamiltonian Bipartite Graphs

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2015年第2期31卷 313-324页

作者： Xiu-mei WANG jin-jiang yuan Yi-xun LIN School of Mathematics and Statistics Zhengzhou University

The perfect matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. A graph is called perfect matching compact（shortly, PM-compact）, if its perfect matching polytope has diameter one. This paper gives a complete characterization of simple PM-compact Hamiltonian bipartite graphs. We first define two families of graphs, called the H2C-bipartite graphs and the H23-bipartite graphs, respectively. Then we show that, for a simple Hamiltonian bipartite graph G with ｜V（G）｜ ≥ 6, G is PM-compact if and only if G is K3,3, or G is a spanning Hamiltonian subgraph of either an H2C-bipartite graph or an H23-bipartite graph.

关键词： perfect matching polytope perfect-matching graph bipartite graph hamiltonian graph

Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2019年第2期7卷 303-319页

作者： jin-jiang yuan Li-Li Ren Ji Tian Ru-Yan Fu School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China School of Mathematics China University of Mining and TechnologyXuzhou 221116JiangsuChina

We study an online(over time)scheduling problem on two uniform unbounded parallel-batch machines with processing speed 1 and v(0<≤1),respectively,to minimize the *** first show that no online algorithm can have a competitive ratio less than 1+αL,whereαL=(√5−1)/2≈0.618 if 0≤1/2,andαL=α2(v)is the positive root ofα^(3)+3α^(2)+(3−1/v)α−1/v=0 if1/2≤*** lower bound is still valid when all jobs have the same processing ***,we provide an online algorithm with a competitive ratio at most min{(√5+1)/2,√2/v}.When the jobs have the same processing times,we present the best possible online algorithm with a competitive ratio 1+αL.

关键词： Online scheduling Uniform parallel-batch machines Makespan Competitive ratio

Improved Approximation Algorithm for Scheduling on a Serial Batch Machine with Split-Allowed Delivery

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2020年第1期8卷 133-143页

作者： Ru-Bing Chen Ling-Fa Lu jin-jiang yuan Li-Qi Zhang School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China College of Information and Management Science Henan Agricultural UniversityZhengzhou 450003China

This paper considers the integrated production and delivery scheduling on a serial batch machine,in which split is allowed in the delivery of the *** objective is to minimize the makespan,i.e.,the maximum delivery completion time of the *** et al.(Theor Comput Sci 572:50–57,2015)showed that this problem is strongly NP-hard,and presented a 32-approximation *** this paper,we present an improved 43-approximation algorithm for this *** also present a polynomial-time algorithm for the special case when all jobs have the identical weight.

关键词： Scheduling Production and delivery Serial batch Approximation algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

PMF模型解析土壤重金属来源的不确定性

中国环境科学 2020年第2期40卷 716-725页

作者：李娇滕彦国吴劲陈海洋蒋进元生态环境部土壤与农业农村生态环境监管技术中心北京100012 北京师范大学水科学研究院北京100875 北京工业大学建筑工程学院北京100124

正定因子矩阵分解(PMF)是目前污染源解析领域应用最为广泛的受体模型之一,其不确定性研究一直是源解析研究的前沿和热点.利用拔靴法(BS)、替换法(DISP)和拔靴-替换法(BS-DISP)3种不确定性分析方法探讨了PMF模型应用于土壤重金属源解析... 详细信息

正定因子矩阵分解(PMF)是目前污染源解析领域应用最为广泛的受体模型之一,其不确定性研究一直是源解析研究的前沿和热点.利用拔靴法(BS)、替换法(DISP)和拔靴-替换法(BS-DISP)3种不确定性分析方法探讨了PMF模型应用于土壤重金属源解析的不确定性,并以德兴铜矿周边土壤重金属为对象开展案例研究.结果表明,6因子情景是PMF模型最佳运行结果;在6因子情景的源成分谱中,除Cr和Ti外,DISP和BS不确定性区间均处于标识元素基本值的0.6~1.5倍之间,BS-DISP不确定性区间处于基本值的0.6~1.6倍之间;模型结果的不确定性更多源于因子旋转误差.通过这3种不确定性分析方法可以获得PMF模型运算中的随机误差和因子旋转误差.其中,BS-DISP法和BS法得到的结果能够辅助判断因子数是否过拟合,并有助于理解源谱的不确定性,而DISP法能够用于理解旋转的不确定性,可作为评价旋转过程可行性的方法.

关键词：土壤重金属源解析 PMF模型误差估计不确定性