scholarly journals Scheduling on uniform processors with at most one downtime on each machine

2015 ◽  
Vol 17 ◽  
pp. 14-24 ◽  
Author(s):  
Liliana Grigoriu ◽  
Donald K. Friesen
Keyword(s):  
Uniform Processors

Scheduling imprecise computation tasks on uniform processors

2007 ◽  
Vol 104 (2) ◽  
pp. 45-52 ◽  
Author(s):  
Guohua Wan ◽  
Joseph Y.-T. Leung ◽  
Michael L. Pinedo
Keyword(s):  
Imprecise Computation ◽  
Uniform Processors

scholarly journals Scheduling complete intrees on two uniform processors with communication delays

1996 ◽  
Vol 58 (5) ◽  
pp. 255-263 ◽  
Author(s):  
Jacek Błażewicz ◽  
Pascal Bouvry ◽  
Frédéric Guinand ◽  
Denis Trystram
Keyword(s):  
Communication Delays ◽  
Uniform Processors

Tighter Bounds for LPT Scheduling on Uniform Processors

1987 ◽  
Vol 16 (3) ◽  
pp. 554-560 ◽  
Author(s):  
Donald K. Friesen
Keyword(s):  
Uniform Processors

scholarly journals Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

2015 ◽  
Vol 25 (1) ◽  
pp. 109-116 ◽  
Author(s):  
Hanna Furmańczyk ◽  
Marek Kubale
Keyword(s):  
Broad Spectrum ◽  
Unit Length ◽  
Batch Scheduling ◽  
Cubic Graphs ◽  
Equitable Coloring ◽  
Np Complete ◽  
Graph Parameters ◽  
Incompatibility Graph ◽  
Spectrum Of Graph ◽  
Uniform Processors

Abstract In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize the makespan.

Sign in / Sign up

Export Citation Format

Share Document