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.
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.
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.
The search session has expired. Please query the service again.
Displaying 41 –
60 of
234
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent...
This is a tutorial survey of recent results in the area of multiprocessor scheduling. Computational complexity theory provides the framework in which these results are presented. They involve on one hand the development of new polynomial optimization algorithms, and on the other hand the application of the concept of NP-hardness as well as the analysis of approximation algorithms.
A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence....
This paper deals with the parallel-machine scheduling problem with the aim of minimizing
the total (weighted) tardiness under the assumption of different release dates. This
problem has been proven to be NP-hard. We introduce some new lower and upper bounds based
on different approaches. We propose a branch-and-bound algorithm to solve the weighted and
unweighted total tardiness. Computational experiments were performed on a large set of
instances...
This paper deals with the parallel-machine scheduling problem with the aim of minimizing
the total (weighted) tardiness under the assumption of different release dates. This
problem has been proven to be NP-hard. We introduce some new lower and upper bounds based
on different approaches. We propose a branch-and-bound algorithm to solve the weighted and
unweighted total tardiness. Computational experiments were performed on a large set of
instances...
Les modèles classiques de coloration doivent leur notoriété en grande partie à leurs applications à des problèmes de type emploi du temps ; nous présentons les concepts de base des colorations ainsi qu’une série de variations et de généralisations motivées par divers problèmes d’ordonnancement dont les élaborations d’horaires scolaires. Quelques algorithmes exacts et heuristiques seront présentés et nous esquisserons des méthodes basées sur la recherche Tabou pour trouver des solutions approchées...
The classical colouring models are well known thanks in large part to
their applications to scheduling type problems; we describe the basic
concepts of colourings together with a number of variations and
generalisations arising from scheduling problems such as the creation
of school schedules. Some exact and heuristic algorithms will be
presented, and we will sketch solution methods based on tabu search to
find approximate solutions to large problems. Finally we will also
mention the use...
A vector is said to be an eigenvector of a square max-min matrix if . An eigenvector of is called the greatest -eigenvector of if and for each eigenvector . A max-min matrix is called strongly -robust if the orbit reaches the greatest -eigenvector with any starting vector of . We suggest an algorithm for computing the greatest -eigenvector of and study the strong -robustness. The necessary and sufficient conditions for strong -robustness are introduced and an efficient...
We propose a temporal decomposition approach for the one-machine scheduling
problem with ready times and due dates. A set of feasible schedules is
characterized by means of constraint-based analysis rules. They permit the
determination of the feasible locations of each task in a sequence, represented
by rank intervals. A decomposition procedure based on comparisons of rank
intervals is developed in order to group tasks to be sequenced in the
neighbourhood of each other in a feasible solution. Computational...
Currently displaying 41 –
60 of
234