检索结果-内蒙古大学图书馆

Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

COMPUTERS & OPERATIONS RESEARCH 2002年第7期29卷 841-848页

作者： Hiraishi, K Levner, E Vlach, M Japan Adv Inst Sci & Technol Sch Informat Sci Tatsunokuchi Ishikawa 9231292 Japan Holon Inst Technol IL-58102 Holon Israel

We study the problem of nonpreemptively scheduling n jobs on m identical machines in parallel to maximize the weighted number of jobs that are completed exactly at their due dates. We show that this problem is solvable in polynomial time even if positive set-up times are allowed. Moreover, we show that if due date tolerances are permitted, then already the single-machine case is NP-hard even if all set-up times are zero and all weights are the same.

关键词： scheduling parallel machines irregular objective just-in-time set-up times polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

A complexity perspective on entailment of parameterized linear constraints

引用

CONSTRAINTS 2012年第4期17卷 461-487页

作者： Eirinakis, Pavlos Ruggieri, Salvatore Subramani, K. Wojciechowski, Piotr W Virginia Univ LDCSEE Morgantown WV 26506 USA Univ Pisa Dipartimento Informat Pisa Italy

Extending linear constraints by admitting parameters allows for more abstract problem modeling and reasoning. A lot of focus has been given to conducting research that demonstrates the usefulness of parameterized linear constraints and implementing tools that utilize their modeling strength. However, there is no approach that considers basic theoretical tools related to such constraints that allow for reasoning over them. Hence, in this paper we introduce satisfiability with respect to polyhedral sets and entailment for the class of parameterized linear constraints. In order to study the computational complexities of these problems, we relate them to classes of quantified linear implications. The problem of satisfiability with respect to polyhedral sets is then shown to be co- hard. The entailment problem is also shown to be co- hard in its general form. Nevertheless, we characterize some subclasses for which this problem is in a"(TM). Furthermore, we examine a weakening and a strengthening extension of the entailment problem. The weak entailment problem is proved to be complete. On the other hand, the strong entailment problem is shown to be co- hard.

关键词： Entailment Parameterized linear constraint Quantified linear program Quantified linear implication Computational complexity polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

Stability in P₅- and banner-free graphs

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年第2期125卷 292-297页

作者： Lozin, VV Nizhny Novgorod Univ Nizhnii Novgorod 603600 Russia

We prove polynomial solvability of the maximum stable set problem in P-5-free banner-free ((P-5,B)-free) graphs, where Ps is the simple path on five vertices and a banner is the graph with vertices a,b,c,d,e and edges... 详细信息

关键词： graph theory stable set polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

ON THE BOTTLENECK CAPACITY EXPANSION PROBLEMS ON NETWORKS

引用

Acta Mathematica Scientia 2006年第2期26卷 202-208页

作者：杨超张建中 College of Management Department of Mathematics City University of Hong Kong Hong KongChina

This article considers a class of bottleneck capacity expansion problems. Such problems aim to enhance bottleneck capacity to a certain level with minimum cost. Given a network G（V,A,C^-） consisting of a set of nodes V = {v1,v2,... ,vn}, a set of arcs A C {（vi,vj）｜ i = 1,2,...,n; j = 1,2,...,n} and a capacity vector C. The component C^-ij of C is the capacity of arc （vi, vj）. Define the capacity of a subset A′ of A as the minimum capacity of the arcs in A, the capacity of a family F of subsets of A is the maximum capacity of its members. There are two types of expanding models. In the arc-expanding model, the unit cost to increase the capacity of arc （vi, vj） is ωij. In the node-expanding model, it is assumed that the capacities of all arcs （vi, vj） which start at the same node vi should be increased by the same amount and that the unit cost to make such expansion is wi. This article considers three kinds of bottleneck capacity expansion problems （path, spanning arborescence and maximum flow） in both expanding models. For each kind of expansion problems, this article discusses the characteristics of the problems and presents several results on the complexity of the problems.

关键词： Networks and graphs maximum capacity spanning arborescence polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling batches with simultaneous job processing for two-machine shop problems

引用

JOURNAL OF SCHEDULING 2001年第1期4卷 25-51页

作者： Potts, CN Strusevich, VA Tautenhahn, T Univ Southampton Fac Math Studies Southampton SO17 1BJ Hants England Univ Greenwich Sch Comp & Math Sci London SE10 9LS England Otto Von Guericke Univ Fak Math D-39016 Magdeburg Germany

We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexity status of the problem. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： scheduling batching polynomial algorithm NP-hard open shop job shop flow shop

来源：评论

学校读者我要写书评

暂无评论

On the stable set problem in special P₅-free graphs

引用

DISCRETE APPLIED MATHEMATICS 2003年第2-3期125卷 215-224页

作者： Gerber, MU Lozin, VV Swiss Fed Inst Technol EPFL Dept Math CH-1015 Lausanne Switzerland

The complexity status of the stable set problem in P-5-free graphs remains an open question for a long time in spite of a lot of particular results in this direction. The purpose of the present paper is to summarize these results and to propose several new ones. In particular, we prove that the problem of finding a maximum stable set can be solved in polynomial time in the class of (P-5,K-m,K-m)-free graphs for any fixed m. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： stable set stability number polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

Incremental approach to computation of elementary siphons for arbitrary simple sequential processes with resources

引用

IET CONTROL THEORY AND APPLICATIONS 2008年第2期2卷 168-179页

作者： Chao, D. Y. Natl Chengchi Univ Dept Management & Informat Sci Taipei 11623 Taiwan

Computation of elementary siphons proposed by Li et al. is essential for deadlock control and expensive since complete siphon enumeration of the Petri net is needed, and the number of strict minimal siphons (SMS) grows quickly and exponentially with the size of the net. They assumed that the siphon constructed from each resource circuit is an elementary one and proposed a polynomial algorithm to compute elementary siphons. However, the author demonstrates a counter example where there may be an exponential number of resource circuits. Hence, constructing elementary siphons from resource circuits will result in an exponential number of elementary siphons, which is wrong. The author then develops a polynomial algorithm to find elementary siphons, which also constructs all SMS on the way. This is because, in the method proposed by Li et al., a linear algebraic expression must be established for each dependent siphon, which implies, all SMS must be located. However, all elementary siphons with polynomial complexity can be located.

关键词： deadlock control strict minimal siphon Petri net flexible manufacturing system linear algebraic expression Petri nets linear algebra flexible manufacturing systems incremental approach computational complexity polynomial complexity polynomial algorithm elementary siphon

来源：评论

学校读者我要写书评

暂无评论

COMPUTING THE BUMP NUMBER IS EASY

引用

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS 1988年第2期5卷 107-129页

作者： HABIB, M MOHRING, RH STEINER, G ECOLE NATL SUPER TELECOMMUN BRETAGNE DEPT INFORMATBRESTFRANCE TECH UNIV BERLIN FACHBEREICH MATHD-1000 BERLIN 12FED REP GER MCMASTER UNIV FAC BUSINESSHAMILTON L8S 4L8ONTARIOCANADA

The bump number b(P) of a partial order P is the minimum number of comparable adjacent pairs in some linear extension of P. It has an interesting application in the context of linear circuit layout problems. Its determination is equivalent to maximizing the number of jumps in some linear extension of P, for which the corresponding minimization problem (the jump number problem) is known to be NP-hard. We derive a polynomial algorithm for determining b(P). The proof of its correctness is based on a min-max theorem involving simple-structured series-parallel partial orders contained in P. This approach also leads to a characterization of all minimal partial orders (with respect to inclusion of the order relations) with fixed bump number.

关键词： 06A10 partial order 68C25 computational complexity and efficiency of algorithms 68E10 graph theory 90C08 special problems of linear programming Bump number jump number polynomial algorithm linear extension bump-critical min-max theorem extension lattice linear circuit layout

来源：评论

学校读者我要写书评

暂无评论

The Problem of Finding the Maximum Multiple Flow in the Divisible Network and Its Special Cases

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2016年第7期50卷 527-535页

作者： Smirnov, A. V. Demidov Yaroslavl State Univ Ul Sovetskaya 14 Yaroslavl 150000 Russia

In the article the problem of finding the maximum multiple flow in the network of any natural multiplicity is studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of linked arcs, which are adjusted with each other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated. The important property of the divisible network is that every divisible network can be partitioned into parts, which are adjusted on the linked arcs of each multiple and multi-arc. Each part is the ordinary transportation network. The main results of the article are the following subclasses of the problem of finding the maximum multiple flow in the divisible network. 1. The divisible networks with the multi-arc constraints. Assume that only one vertex is the ending vertex for a multi-arc in network parts. In this case the problem can be solved in a polynomial time. 2. The divisible networks with the weak multi-arc constraints. Assume that only one vertex is the ending vertex for a multi-arc in network parts (1 <= s < k - 1) and other parts have at least two such vertices. In that case the multiplicity of the maximum multiple flow problem can be decreased to k - s. 3. The divisible network of the parallel structure. Assume that the divisible network component, which consists of all multiple arcs, can be partitioned into subcomponents, each of them containing exactly one vertex-beginning of a multi-arc. Suppose that intersection of each pair of subcomponents is the only vertex-network source x(0). If k = 2, the maximum flow problem can be solved in a polynomial time. If k >= 3, the problem is NP-complete. The algorithms for each polynomial subclass are suggested. Also, the multiplicity decreasing algorithm for the divisible network with weak multi-arc constraints is formulated.

关键词： multiple networks multiple flows divisible networks NP-completeness polynomial algorithm

来源：评论

学校读者我要写书评

暂无评论

A PRIMAL-DUAL INTERIOR-POINT algorithm BASED ON A NEW KERNEL FUNCTION

引用

ANZIAM JOURNAL 2010年第4期51卷 476-491页

作者： Cho, G. M. Cho, Y. Y. Lee, Y. H. Dongseo Univ Dept Multimedia Engn Pusan 617716 South Korea Pusan Natl Univ Dept Math Pusan 609735 South Korea

We propose a new primal-dual interior-point algorithm based on a new kernel function for linear optimization problems. New search directions and proximity functions are proposed based on the kernel function. We show that the new algorithm has O(root n log n log(n/epsilon)) and O(root n log(n/epsilon)) iteration bounds for large-update and small-update methods, respectively, which are currently the best known bounds for such methods.

关键词： primal-dual interior-point method kernel function complexity polynomial algorithm linear optimization problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：