共查询到20条相似文献,搜索用时 0 毫秒
1.
In an earlier paper, two alternative p-Center problems, where the centers serving costumers must be chosen so that exactly one node from each of p prespecified disjoint pairs of nodes is selected, were shown to be NP-complete. This paper considers a generalized version of these problems, in which the nodes from which the p servers are to be selected are partitioned into k sets and the number of servers selected from each set must be within a prespecified range. We refer to these problems as the ‘Set’ p-Center problems. We establish that the triangle inequality (Δ-inequality) versions of these problems, in which the edge weights are assumed to satisfy the triangle inequality, are also NP-complete. We also provide a polynomial time approximation algorithm for the two Δ-inequality Set p-Center problems that is optimal for one of the problems in the sense that no algorithm with polynomial running time can provide a better constant factor performance guarantee, unless P = NP. For the special case ‘alternative’ p-Center problems, which we refer to as the ‘Pair’ p-Center problems, we extend the previous results in several ways. For example, the results mentioned above for the Set p-Center problems also apply to the Pair p-Center problems. Furthermore, we establish and exploit a correspondence between satisfiability and the dominating set type of problems that naturally arise when considering the decision versions of the Pair p-Center problems. 相似文献
2.
The fitness landscape of the no-wait (continuous) flow-shop scheduling problem is investigated by examining the ruggedness
of the landscape and the correlation between the quality of a solution and its distance to an optimal solution. The results
confirm the presence of a big valley structure as known from other combinatorial optimization problems. The suitability of
the landscape for search with evolutionary computation and local search methods is discussed. The observations are validated
by experiments with two evolutionary algorithms. 相似文献
3.
In this paper, we develop a polynomial-time approximation scheme for the two-machine flow shop scheduling problem with several
availability constraints on the first machine, under the resumable scenario. 相似文献
4.
We consider parallel machine scheduling problems where the processing of the jobs on the machines involves two types of objectives. The first type is one of two classical objective functions in scheduling theory: either the total completion time or the makespan. The second type involves an actual cost associated with the processing of a specific job on a given machine; each job-machine combination may have a different cost. Two bi-criteria scheduling problems are considered: (1) minimize the maximum machine cost subject to the total completion time being at its minimum, and (2) minimize the total machine cost subject to the makespan being at its minimum. Since both problems are strongly NP-hard, we propose fast heuristics and establish their worst-case performance bounds. 相似文献
5.
This paper is concerned with two-machine no-wait flow shop scheduling problems in which the actual processing time of each
job is a proportional function of its starting time and each machine may have non-availability intervals. The objective is
to minimize the makespan. We assume that the non-availability intervals are imposed on only one machine. Moreover, the number
of non-availability intervals, the start time and end time of each interval are known in advance. We show that the problem
with a single non-availability interval is NP-hard in the ordinary sense and the problem with an arbitrary number of non-availability
intervals is NP-hard in the strong sense. 相似文献
6.
We study the problem of scheduling n non-preemptable jobs on a single machine which is not available for processing during a given time period. The objective is to minimize the sum of the job completion times. The best known approximation algorithm for this NP-hard problem has a relative worst-case error bound of 17.6%. We present a parametric O( nlog n)-algorithm H with which better worst-case error bounds can be obtained. The best error bound calculated for the algorithm in the paper is 7.4%. In a computational experiment, we test the algorithm with the performance guarantee set to 10.2%. It turns out that randomly generated instances with up to 1000 jobs can be solved with a mean (maximum) error of 0.31% (3.18%) and a mean (maximum) computation time of 0.8 (9.7) seconds. 相似文献
7.
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has, in every column, blocks of consecutive 1s, each corresponding to a shift. We focus on three types of shift scheduling problems classified according to the column structure in the constraint matrix: columns of consecutive 1s, columns of cyclical 1s, and columns of k consecutive blocks. In particular, the complexity of the cyclical scheduling problem, where the matrix satisfies the property of cyclical 1s in each column, was noted recently by Hochbaum and Tucker to be open. They further showed that the unit demand case is polynomially solvable. Here we extend this result to the uniform requirements case, and provide a 2-approximation algorithm for the non-uniform case. We also establish that the cyclical scheduling problem’s complexity is equivalent to that of the exact matching problem—a problem the complexity status of which is known to be randomized polynomial (RP). We then investigate the three types of shift scheduling problems and show that, while the consecutive ones version is polynomial and the k-block columns version is NP-hard (for k≥2), for the k-blocks problem we give a simple k-approximation algorithm, which is the first approximation algorithm determined for the problem. 相似文献
8.
We study the performance of scheduling algorithms for a manufacturing system, called the ‘no-wait flowshop’, which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each job is processed by at most one machine in each center. The problem of finding the minimum finish time schedule is considered here in a flowshop consisting of two machine centers. Heuristic algorithms are presented and are analyzed in the worst case performance context. For the case of two centers, one with a single machine and the other with m, two heuristics are presented with tight performance guarantees of 3 − (1/ m) and 2. When both centers have m machines, a heuristic is presented with an upper bound performance guarantee of
. It is also shown that this bound can be reduced to 2(1 + ε). For the flowshop with any number of machines in each center, we provide a heuristic algorithm with an upper bound performance guarantee that depends on the relative number of machines in the centers. 相似文献
9.
We investigate the computational complexity of deterministic sequencing problems in which unit-time jobs have to be scheduled on a single machine subject to chain-like precedence constraints. NP-hardness is established for the cases in which the number of late jobs or the total weighted tardiness is to be minimized, and for several related problems involving the total weighted completion time criterion. 相似文献
11.
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion’s value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion. 相似文献
12.
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal graphs, has a PTAS in planar graphs, is APX-hard in bipartite graphs and is 5/3-approximable in any class of graphs where the vertex cover problem is polynomial (in particular in bipartite graphs). Finally, dealing with hypergraphs, we study the complexity and the approximability of two natural generalizations. 相似文献
13.
This paper is a continuation of the research carried out in [1]–[2], where the robustness analysis for stochastic approximation algorithms is given for two cases: 1. The regression function and the Liapunov function are not zero at the sought-for x
0; 2. lim sup
n
a131 n
i=1
n
i+1 is not zero, where {
i
} are the measurement errors and { a
n} are the weighting coefficients in the algorithm. Allowing these deviations from zero to occur simultaneously but to remain small, this paper shows that the estimation error is still small even for a class of measurement errors more general than that considered in [2].This project is supported by the National Natural Science Foundation of China. 相似文献
14.
In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first
machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3.
We then present a polynomially solvable case. 相似文献
15.
In this paper, we deal with a special case of the two-machine flow shop scheduling problem with several availability constraints
on the second machine, under the resumable scenario. We develop an improved algorithm with a relative worst-case error bound
of 4/3. 相似文献
16.
In this paper, no-wait job shop problems with makespan minimization are considered. It is well known that these problems are strongly NP-hard. The problem is decomposed into the sequencing and the timetabling components. Shift timetabling is developed for the timetabling component. An effective method, CLLM (complete local search with limited memory), is presented by integrating with shift timetabling for the sequencing component. Experimental results show that CLLM outperforms all the existing effective algorithms for the considered problem with a little more computation time. 相似文献
17.
In this paper we consider the problem of scheduling n independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the makespan. Each machine is not continuously available at all times and each job can only be processed on specified machines. A network flow approach is used to formulate this scheduling problem into a series of maximum flow problems. We propose a polynomial time binary search algorithm to either verify the infeasibility of the problem or solve it optimally if a feasible schedule exists. 相似文献
18.
平行机排序问题Pm//∑uj当m≥2时是一个NP—难的问题.本文利用求解1//∑uj的Moore算法构造了与P2//∑uj等价的P2//n-∑uj问题的一个多项式时间近似算法,并征明了该算法的绝对性能比为3/4.此外还研究了机器带有准备时间的问题P2,ri//n-∑uj,并证明了在这种情况下算法的渐近性能为2/3。 相似文献
19.
In this paper, we consider a three-machine permutation flow-shop scheduling problem where the criterion is to minimize the total completion time without idle times subject to the minimum makespan on the second machine. This problem is NP-hard while each of the objective functions alone can be optimized in polynomial time. We develop a branch-and-bound algorithm with effective branching rules and dominance properties which help to reduce the search space. By our computational experiments, the branch-and-bound algorithm is comparable to a recent mixed integer programming solver and, for some kinds of problem instances, the branch-and-bound algorithm outperforms the solver. On the other hand, the computational result would indicate that the hierarchical scheduling problems are essentially hard in both theoretical and computational points of view. 相似文献
20.
The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorithm. The algorithms were tested on a set of random-generated problems with up to 500 rows and 5000 columns, and on two sets of problems originating in combinatorial questions with up to 28160 rows and 11264 columns.On the random problems and on one set of combinatorial problems, the best algorithm among those we tested was a randomized greedy algorithm, with the neural network algorithm very close in second place. On the other set of combinatorial problems, the best algorithm was a deterministic greedy variant, and the randomized algorithms (both randomized greedy and neural network) performed quite poorly. The other algorithms we tested were always inferior to the ones mentioned above. 相似文献
|