Unimodular Probing for Minimal Perturbance in Dynamic Resource Feasibility Problems
نویسندگان
چکیده
This paper describes unimodular probing { a new technique that has been used to solve a class of dynamic scheduling problems. In benchmarks a unimodular probing algorithm has outperformed two well-established approaches: backtrack search with local consistency and spe-cialised heuristics, and mixed integer programming (MIP). The problems amenable to unimodular probing involve disjunctive constraints , discrete variables, and a linear optimisation function. In addition , some of the constraints should be totally unimodular { for example, temporal precedence and distance constraints. Problems in this class are diicult for CSP techniques because of the optimisation requirement, and for MIP because of the number of discrete (integer) variables. Our studies have focussed on DCSPs, with an optimisation criterion of minimal perturbance to an existing solution. Unimodular probing builds on an ordinary backtracking repair algorithm with constraint propagation. However, by contrast with previous DCSP algorithms, unimodular probing uses linear programming (LP) optimisation to guide and bound the search. Not only has unimodular probing performed well on randomly generated benchmarks, but it has also been successfully applied in a large industrial application involving hundreds of resources and thousands of tasks.
منابع مشابه
Minimal Perturbation in Dynamic Scheduling
This paper describes an algorithm, unimodular probing, conceived to optimally reconfigure schedules in response to a changing environment. In the problems studied, resources may become unavailable, and scheduled activities may change. The total shift in the start and end times of activities should be kept to a minimum. This requirement is captured in terms of a linear optimization function over...
متن کاملEvaluation of Dynamic Probing Testing Effect in Hand Excavated Pit on Test Results Using Numerical Modeling
In Iran, using the hand excavated pits (wells) have been more common compared to other countries. As a matter of fact, recent years, utilizing the dynamic probing test (DPT) in these types of pits has been significantly developed in Iran. This is while the standard state of doing this test is from the ground level. In this work, the dynamic probing test is carried out in two similar wells with ...
متن کاملDecomposing Random Mechanisms
Random mechanisms have been used in real-life situations for reasons such as fairness. Voting and matching are two examples of such situations. We investigate whether desirable properties of a random mechanism survive decomposition of the mechanism as a lottery over deterministic mechanisms that also hold such properties. To this end, we represent properties of mechanisms—such as ordinal strate...
متن کاملA probing process for dynamic resource allocation in fixed broadband wireless access networks
This paper deals with the support of both real-time and non-real-time communication services in a broadband fixed wireless access network. It investigates the feasibility of dynamically allocating the bandwidth not utilized by other sectors in the staggered resource allocation method. A new medium-access control (MAC) protocol based on the proposed probing process that does not need information...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کامل