Upper bound on the number of processors for scheduling with interprocessor communication delays
Year of publication: |
2000
|
---|---|
Authors: | Moukrim, Aziz |
Published in: |
Mathematical Methods of Operations Research. - Springer. - Vol. 52.2000, 1, p. 99-113
|
Publisher: |
Springer |
Subject: | scheduling | makespan | communication delays | minimum number of processors |
-
Upper bound on the number of processors for scheduling with interprocessor communication delays
Moukrim, Aziz, (2000)
-
A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity
Lee, Wen-Chiung, (2015)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
- More ...
-
An effective PSO-inspired algorithm for the team orienteering problem
Dang, Duc-Cuong, (2013)
-
Upper bound on the number of processors for scheduling with interprocessor communication delays
Moukrim, Aziz, (2000)
-
An optimization-based heuristic for the robotic cell problem
Carlier, Jacques, (2010)
- More ...