Displaying similar documents to “How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations”

Scheduling with periodic availability constraints and irregular cost functions

Francis Sourd (2007)

RAIRO - Operations Research

Similarity:

This paper addresses a one-machine scheduling problem in which the efficiency of the machine is not constant, that is the duration of a task is longer in badly efficient time periods. Each task has an irregular completion cost. Under the assumption that the efficiency constraints are time-periodic, we show that the special case where the sequence is fixed can be solved in polynomial time. The general case is NP-complete so that we propose a two-phase heuristic to find good solutions....

Periodic coordination in hierarchical air defence systems

Piotr Arabas, Krzysztof Malinowski (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

The subject of this work is the defence planning of a point target against an air attack. The defence system is decomposed into a number of sectors. A direct method of coordination is used at the upper level, while the sectors use a discrete-time event-based model and the description of uncertainty by multiple scenarios of an attack. The resulting problems are solved using linear programming. A comparison of two coordination strategies for realistic attack scenarios and an analysis of...

Existence and uniqueness of positive periodic solutions of delayed Nicholson's blowflies models

Fei Long, Bingwen Liu (2012)

Annales Polonici Mathematici

Similarity:

This paper is concerned with a class of Nicholson's blowflies models with multiple time-varying delays. By applying the coincidence degree, some criteria are established for the existence and uniqueness of positive periodic solutions of the model. Moreover, a totally new approach to proving the uniqueness of positive periodic solutions is proposed. In particular, an example is employed to illustrate the main results.

A new formulation for scheduling unrelated processor under precedence constraints

Nelson Maculan, Stella C.S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (2010)

RAIRO - Operations Research

Similarity:

We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.

Periodic solutions of nonlinear differential systems by the method of averaging

Zhanyong Li, Qihuai Liu, Kelei Zhang (2020)

Applications of Mathematics

Similarity:

In many engineering problems, when studying the existence of periodic solutions to a nonlinear system with a small parameter via the local averaging theorem, it is necessary to verify some properties of the fundamental solution matrix to the corresponding linearized system along the periodic solution of the unperturbed system. But sometimes, it is difficult or it requires a lot of calculations. In this paper, a few simple and effective methods are introduced to investigate the existence...