The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In the job shop scheduling problem k-units-Jm, there are
m machines and each machine has an integer processing time of at most
k time units. Each job consists of a permutation of m
tasks corresponding to all machines and thus all jobs have an identical
dilation D.
The contribution of this paper are the
following results;
(i) for jobs and every fixed k, the makespan of
an optimal schedule is at most D+ o(D), which extends the result of [3]
for k=1;
(ii) a randomized on-line approximation...
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
We consider the NP Hard problems of online Bin Covering and Packing while
requiring that larger (or longer, in the one dimensional case)
items be placed at the bottom of the bins, below smaller (or
shorter) items — we call such a version, the LIB
version of problems. Bin sizes can be uniform or variable. We look
at computational studies for both the Best Fit and Harmonic Fit
algorithms for uniform sized bin covering. The Best Fit heuristic for
this version of the problem is introduced here.
The...
In on-line computation, the instance of the problem dealt is not
entirely known from the beginning of the solution process, but it
is revealed step-by-step. In this paper we deal with on-line
independent set. On-line models studied until now for this problem
suppose that the input graph is initially empty and revealed
either vertex-by-vertex, or cluster-by-cluster. Here we present a
new on-line model quite different to the ones already studied. It
assumes that a superset of the final graph is initially...
Applied research into Renewable Energies raises complex challenges of a technological, economical or political nature. In this paper, we address the techno−economical optimization problem of selecting locations of wind and solar Parks to be built in Egypt, such that the electricity demand is satisfied at minimal costs. Ultimately, our goal is to build a decision support tool that will provide private and governmental investors into renewable energy systems, valuable insights to make informed short...
We consider the parallel approximability of two problems arising from high multiplicity scheduling, namely the unweighted model with variable processing requirements and the weighted model with identical processing requirements. These two problems are known to be modelled by a class of quadratic programs that are efficiently solvable in polynomial time. On the parallel setting, both problems are P-complete and hence cannot be efficiently solved in parallel unless P = NC. To deal with the parallel...
We consider the parallel approximability of two problems arising
from high multiplicity scheduling, namely the unweighted
model with variable processing requirements and the weighted model with identical processing requirements. These two
problems are known to be modelled by a class of quadratic programs
that are efficiently solvable in polynomial time. On the parallel
setting, both problems are P-complete and hence cannot be
efficiently solved in parallel unless P = NC. To deal with the
parallel...
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in phenotype...
We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define.
We illustrate this approach by exhibiting an approximation algorithm for
kinship assignment in the case of the Simpson index with a priori error bound and
running time that is polynomial in the bit size of the population, but exponential in phenotype...
Bref survol du théorème de non-plongement de J. Cheeger et B. Kleiner pour le groupe d’Heisenberg dans .
In this paper, we study the problem of makespan minimization for the multiprocessor
scheduling problem in the presence of communication delays. The communication delay
between two tasks i and j depends on the distance
between the two processors on which these two tasks are executed. Lahlou shows that a
simple polynomial-time algorithm exists when the length of the schedule is at most two
(the problem becomes 𝒩𝒫-complete when the length of the schedule
...
In this paper, we study the problem of makespan minimization for the multiprocessor
scheduling problem in the presence of communication delays. The communication delay
between two tasks i and j depends on the distance
between the two processors on which these two tasks are executed. Lahlou shows that a
simple polynomial-time algorithm exists when the length of the schedule is at most two
(the problem becomes 𝒩𝒫-complete when the length of the schedule
...
We present the combination of a state control and shape design approaches for the optimization of micro-fluidic channels used for sample extraction and separation of chemical species existing in a buffer solution. The aim is to improve the extraction and identification capacities of electroosmotic micro-fluidic devices by avoiding dispersion of the extracted advected band.
We present the combination of a state control and shape design approaches
for the optimization of micro-fluidic channels used for sample extraction and
separation of chemical species existing in a buffer solution.
The aim is to improve the extraction and identification capacities of
electroosmotic micro-fluidic devices by avoiding dispersion of the
extracted advected band.
Currently displaying 41 –
58 of
58