Optimum workforce scheduling under the (14, 21) days-off timetable.
Order level inventory models for deteriorating seasonable/Fashionable products with time dependent demand and shortages.
Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
Ordonnancement des mouvements de trésorerie
Ordonnancements à contraintes disjonctives
Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
Organizing Transportation on a Double-Track Line Under Conditions of Major Overhaul on One Track
Original title unknown
Original title unknown
Original title unknown
Original title unknown
Oб одной бесконечношаговой модели леонтьевского типа
Paradox in a Non-Linear Capacitated Transportation Problem
Parallel approximation to high multiplicity scheduling problems smooth multi-valued quadratic programming
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...
Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming
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...
Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem.
Parallel machine scheduling with uncertain communication delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model an estimation...
Parallel Machine Scheduling with Uncertain Communication Delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model an estimation...
Parallélisation d'une combinaison des méthodes de Monte-Carlo et quasi-Monte-Carlo et application aux réseaux de files d'attente
Parallélisation d'une Combinaison des Méthodes de Monte-Carlo et Quasi-Monte-Carlo et Application aux Réseaux de Files d'Attente
We propose a parallel algorithm which uses both Monte-Carlo and quasi-Monte-Carlo methods. A detailed analysis of this algorithm, followed by examples, shows that the estimator's efficiency is a linear function of the processor number. As a concrete application example, we evaluate performance measures of a multi-class queueing network in steady state.