234 research outputs found

    The lockmaster's problem.

    Get PDF
    Inland waterways form a natural network that is an existing, congestion free infrastructure with capacity for more traffic.Transportation of goods by ship is widely promoted as it is a reliable, efficient and environmental friendly way of transport. A bottleneck for transportation over water are the locks that manage the water level. The lockmaster's problem concerns the optimal strategy for operating such a lock. In the lockmaster's problem we are given a lock, a set of ships coming from downstream that want to go upstream, and another set of ships coming from upstream that want to go downstream. We are given the arrival times of the ships and a constant lockage time; the goal is to minimize total waiting time of the ships. In this paper a dynamic programming algorithm (DP) is proposed that solves the lockmaster's problem in polynomial time. We extend this DP to different generalizations that consider weights, water usage, capacity, and (a fixed number of) multiple chambers. Finally, we prove that the problem becomes strongly NP-hard when the number of chambers is part of the input.Lock scheduling; Batch scheduling; Dynamic programming; Complexity;

    Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines

    Full text link
    In the paper we consider the problem of scheduling nn identical jobs on 4 uniform machines with speeds s1≥s2≥s3≥s4,s_1 \geq s_2 \geq s_3 \geq s_4, respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incompatibility graph of degree Δ\Delta, where two incompatible jobs cannot be processed on the same machine. We show that the problem is NP-hard even if s1=s2=s3s_1=s_2=s_3. If, however, Δ≤4\Delta \leq 4 and s1≥12s2s_1 \geq 12 s_2, s2=s3=s4s_2=s_3=s_4, then the problem can be solved to optimality in time O(n1.5)O(n^{1.5}). The same algorithm returns a solution of value at most 2 times optimal provided that s1≥2s2s_1 \geq 2s_2. Finally, we study the case s1≥s2≥s3=s4s_1 \geq s_2 \geq s_3=s_4 and give an O(n1.5)O(n^{1.5})-time 32/1532/15-approximation algorithm in all such situations

    Partitioning a weighted partial order.

    Get PDF
    The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not only assume that the chains have bounded size, but also that a weight wi is given for each element i in the partial order such that wiOrder; Studies; Size; Lower bounds;

    Scheduling hybrid flowshop with parallel batching machines and compatibilities.

    Get PDF
    International audienceThis paper considers a two-stage hybrid flowshop problem in which the first stage contains several identical discrete machines, and the second stage contains several identical batching machines. Each discrete machine can process no more than one task at time, and each batching machine can process several tasks simultaneously in a batch with the additional feature that the tasks of the same batch have to be compatible. A compatibility relation is defined between each pair of tasks, so that an undirected compatibility graph is obtained which turns out to be an interval graph. The batch processing time is equal to the maximal processing time of the tasks in this batch, and all tasks of the same batch start and finish together. The goal is to make batching and sequencing decisions in order to minimize the makespan. Since the problem is NP-hard, we develop several heuristics along with their worst cases analysis. We also consider the case in which tasks have the same processing time on the first stage, for which a polynomial time approximation scheme (PTAS) algorithm is presented

    Capacitated max-Batching with Interval Graph Compatibilities

    Get PDF
    We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving an open question from [7, 4, 5], we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we give a PTAS based on a novel dynamic programming technique for this case.

    A Classification and Survey of Computer System Performance Evaluation Techniques

    Get PDF
    Classification and survey of computer system performance evaluation technique

    A Unified Framework for Integer Programming Formulation of Graph Matching Problems

    Get PDF
    Graph theory has been a powerful tool in solving difficult and complex problems arising in all disciplines. In particular, graph matching is a classical problem in pattern analysis with enormous applications. Many graph problems have been formulated as a mathematical program then solved using exact, heuristic and/or approximated-guaranteed procedures. On the other hand, graph theory has been a powerful tool in visualizing and understanding of complex mathematical programming problems, especially integer programs. Formulating a graph problem as a natural integer program (IP) is often a challenging task. However, an IP formulation of the problem has many advantages. Several researchers have noted the need for natural IP formulation of graph theoretic problems. The aim of the present study is to provide a unified framework for IP formulation of graph matching problems. Although there are many surveys on graph matching problems, however, none is concerned with IP formulation. This paper is the first to provide a comprehensive IP formulation for such problems. The framework includes variety of graph optimization problems in the literature. While these problems have been studied by different research communities, however, the framework presented here helps to bring efforts from different disciplines to tackle such diverse and complex problems. We hope the present study can significantly help to simplify some of difficult problems arising in practice, especially in pattern analysis
    • …
    corecore