Search results for "preemption"
showing 8 items of 8 documents
Integer Preemption Problems
2014
A fundamental assumption in the basic RCPSP is that activities in progress are non-preemptable. Some papers reveal the potential benefits of allowing activity interruptions in the schedule when the objective is the makespan minimization. In this chapter we consider the Maxnint_PRCPSP in which it is assumed that activities can be interrupted at any integer time instant with no cost incurred, that each activity can be split into a maximum number of parts, and that each part has a minimum duration established. We show how some procedures developed for the RCPSP can be adapted to work with the Maxnint_PRCPSP and we introduce some procedures specifically designed for this problem. Furthermore, p…
Pierwszeństwo w polskim systemie prawnym
2017
The polish law system the institutions of priority and preemption are present in many different acts. They are relating with many diversified subjects. Despite of this, the legislator sometimes uses it a alternately. It makes a problem with definitions - in they are one institution or two. The other questions are following: why priority should be distinctive institution? Is it better for polish civil law procedure? What about differences between priority and preemption ? This article try to answer these problems by analysis of actual acts.
Scheduling projects with limited number of preemptions
2009
A recent paper (Ballestin F, Valls V, Quintanilla S. Preemption in resource-constrained project scheduling. European Journal of Operational Research 2008;189:1136-152) revealed the potential benefits of allowing one interruption when scheduling activities in a resource-constrained project. This paper further investigates the effect of interruption on project length in more general cases. To achieve this, a new model that covers most practical applications of discrete activity preemption is proposed and a metaheuristic algorithm for the problem is developed. Computational experiments on the standard j120 and j30 sets generated using ProGen study the difference in makespan between allowing m …
Stackelberg equilibrium with many leaders and followers. The case of zero fixed costs
2017
Abstract I study a version of the Stackelberg game with many identical firms in which leaders and followers use a continuous cost function with no fixed cost. Using lattice theoretical methods I provide a set of conditions that guarantee that the game has an equilibrium in pure strategies. With convex costs the model shows the same properties as a quasi-competitive Cournot model. The same happens with concave costs, but only when the number of followers is small. When this number is large the leaders preempt entry. I study the comparative statics and the limit behavior of the equilibrium and I show how the main determinants of market structure interact. More competition between the leaders …
ENDOGENOUS TIMING WITH FREE ENTRY
2006
A free entry model with linear costs is considered where firms first choose their entry time and then compete in the market according to the resulting timing decisions. Multiple equilibria arise allowing for infinitely many industry output configurations encompassing one limit-output dominant firm and the Cournot equilibrium with free entry as extreme cases. Sequential entry is never observed. Both Stackelberg and Cournot-like outcomes are sustainable as equilibria however. When the number of incumbents is given, entry is always prevented, and industry output is sometimes larger than the entry preventing level.
Proportional and Preemption-Enabled Traffic Offloading for IP Flow Mobility: Algorithms and Performance Evaluation
2018
IP Flow Mobility (IFOM) enables a user equipment to offload data traffic at the IP flow level. Although the procedure of IFOM-based flow offloading has been specified by 3GPP, how many IP flows should be offloaded and when offloading should be performed are not defined. Consequently, IP flows may be routed to a target access network which has a strong signal strength but with backhaul congestion or insufficient access capability. In this paper, we propose two algorithms, referred to as proportional offloading (PO), and proportional and preemption-enabled offloading (PPO), respectively, for IP flow offloading in hybrid cellular and wireless local area networks. The PO algorithm decides an op…
Endogenous timing with infinitely many firms
2008
Abstract A model with constant marginal costs is considered where firms choose first a period for production and then the amount to produce when competing in the market according to the resulting timing decisions. Multiple equilibria arise allowing for infinitely many industry output configurations encompassing one limit-output dominant firm and the Cournot equilibrium with free entry as extreme cases. At each of these equilibria a firm produces a positive amount only if this firm commits to produce at period one. Both Stackelberg and Cournot-like outcomes are sustainable as equilibria however. When the number of leaders is given, production at subsequent periods is always prevented, and in…
Compiler Driven Automatic Kernel Context Migration for Heterogeneous Computing
2014
Computer systems provide different heterogeneous resources (e.g., GPUs, DSPs and FPGAs) that accelerate applications and that can reduce the energy consumption by using them. Usually, these resources have an isolated memory and a require target specific code to be written. There exist tools that can automatically generate target specific codes for program parts, so-called kernels. The data objects required for a target kernel execution need to be moved to the target resource memory. It is the programmers' responsibility to serialize these data objects used in the kernel and to copy them to or from the resource's memory. Typically, the programmer writes his own serializing function or uses e…