The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 41 –
60 of
102
The issue of energy-aware traffic engineering has become prominent in telecommunications industry in the last years. This paper presents a two-criteria network optimization problem, in which routing and bandwidth allocation are determined jointly, so as to minimize the amount of energy consumed by a telecommunication infrastructure and to satisfy given demands represented by a traffic matrix. A scalarization of the criteria is proposed and the choice of model parameters is discussed in detail. The...
This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they have at most...
This paper is devoted to the following version of the single machine
preemptive scheduling problem of minimizing the weighted number of late
jobs. A processing time, a release date, a due date and a weight of each
job are given. Certain jobs are specified to be completed in time, i.e.,
their due dates are assigned to be deadlines, while the other jobs are
allowed to be completed after their due dates. The release/due date
intervals are nested, i.e., no two of them overlap (either they have...
Markov chain usage models were successfully used to model systems and software. The most prominent approaches are the so-called failure state models Whittaker and Thomason (1994) and the arc-based Bayesian models Sayre and Poore (2000). In this paper we propose arc-based semi-Markov usage models to test systems. We extend previous studies that rely on the Markov chain assumption to the more general semi-Markovian setting. Among the obtained results we give a closed form representation of the first...
This paper considers large shift scheduling problems with different shift
start times and lengths, fractionable breaks and work stretch duration
restrictions. Two solution approaches are proposed to solve the problems
over a multiple-day planning horizon. The first approach is based on a
local branching strategy and the second one is based on a temporal
decomposition of the problem. Local branching is very
efficient in finding good feasible solutions when compared to a classical
branch-and-bound...
In this study, we consider a scheduling environment with m(m ≥ 1) parallel machines. The set of jobs to schedule is divided into K disjoint subsets. Each subset of jobs is associated with one agent. The K agents compete to perform their jobs on common resources. The objective is to find a schedule that minimizes a global objective function f0, while maintaining the regular objective function of each agent, fk, at a level no greater than a fixed value, εk (fk ∈ {fkmax, ∑fk}, k = 0, ..., K). This...
A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
The simple plant location problem (SPLP) is considered and
a genetic algorithm is
proposed to solve this problem. By using the developed
algorithm it is possible to solve SPLP
with more than 1000 facility sites and customers.
Computational results are presented and
compared to dual based algorithms.
Currently displaying 41 –
60 of
102