The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 141 –
160 of
234
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...
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...
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...
We deal with a logistic problem motivated by a case study from a company dealing with inland transportation of piece goods in regular cycles. The problem consists in transportation of goods among regional centres – hubs of a network. Demands on transportation are contained in a matrix of flows of goods between pairs of hubs. The transport is performed by vehicles covering the shipping demands and the task is to design a cyclical route and to place a depot for each vehicle. The route depot can be...
We describe an O.R. technique which plans the allotment of
time of the collaborators of a big company. The proposed method not only
considers the immediate profitability of the company, but also the
training of
the collaborators in order to guarantee the success of the company's
rising
generation. The proposed method uses a greedy approach and constitutes
therefore a simple and fast tool for decision makers. It has been
successfully
implemented in an important Swiss bank society.
We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption Constrained Scheduling Problem) which is an extension of both the well-known Resource Constrained Scheduling Problem and the Scheduling Problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and...
En este trabajo se analiza un problema planteado recientemente a sus autores por una empresa fabricante de componentes de automóviles. Dicha empresa almacena sus productos manufacturados hasta que los clientes (compradores) pasan a recogerlos. Los clientes solicitan sus productos con una frecuencia conocida. Se trata de determinar, en función de dichas frecuencias, en qué fechas y a qué horas o slots han de pasar los clientes a recoger sus pedidos. Fijado el horizonte temporal objeto de estudio,...
Currently displaying 141 –
160 of
234