Integrated sequencing and scheduling in coil coating
We consider a complex planning problem in integrated steel production. A sequence of coils
of sheet metal needs to be color coated in consecutive stages. Different coil geometries and …
of sheet metal needs to be color coated in consecutive stages. Different coil geometries and …
An efficient parallel algorithm for solving the knapsack problem on hypercubes
We present in this paper an efficient algorithm for solving the integral Knapsack problem on
hypercube. The main idea is to represent the computations of the dynamic programming …
hypercube. The main idea is to represent the computations of the dynamic programming …
Scheduling with communication delays
In this chapter, we consider scheduling with communication delays. This model assumes
that a parallel application is a set of sequential communicating processes (or threads) which …
that a parallel application is a set of sequential communicating processes (or threads) which …
Scheduling on large scale distributed platforms: from models to implementations
Today, large scale parallel systems are available at low cost, Many powerful such systems
have been installed all over the world and the number of users is always increasing. The …
have been installed all over the world and the number of users is always increasing. The …
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 …
execution. In that case computing a complete schedule off-line with estimated data may lead …
Scheduling with communication delays and on-line disturbances
This paper considers the problem of scheduling tasks on multiprocessors. Two tasks linked
by a precedence constraint and executed by two different processors must communicate …
by a precedence constraint and executed by two different processors must communicate …
[HTML][HTML] An optimal schedule for Gaussian elimination on an MIMD architecture
R Saad - Journal of computational and applied mathematics, 2006 - Elsevier
An optimal schedule for Gaussian elimination on an MIMD architecture - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
[PDF][PDF] Scheduling Tasks with Communication Delays on Multi-Levels Clusters.
A set of tasks has to be scheduled on the parallel identical processors of the clusters of a
multi-levels distributed memory multiprocessor, subject to precedence constraints and small …
multi-levels distributed memory multiprocessor, subject to precedence constraints and small …
[HTML][HTML] Complexity and approximation results for scheduling multiprocessor tasks on a ring
We study a multiprocessor task scheduling problem, in which each task requires a set of μ
processors with consecutiveness constraints to be executed. This occurs, for example, when …
processors with consecutiveness constraints to be executed. This occurs, for example, when …
[PDF][PDF] Complex single machine scheduling: Theoretical and practical aspects of sequencing
W Höhn - 2014 - d-nb.info
diss hoehn Page 1 Complex Single Machine Scheduling Theoretical and Practical Aspects of
Sequencing D issertation Wiebke Höhn TU Berlin Feb 2014 Page 2 Page 3 Complex Single …
Sequencing D issertation Wiebke Höhn TU Berlin Feb 2014 Page 2 Page 3 Complex Single …