Bounding the Maximum Size of a Packet Radio Network
IEEE Transactions on Computers
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Semi-normal Schedulings: Improvement on Goemans' Algorithm
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Fast and Simple Local Search for Graph Coloring
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An approximation result for the interval coloring problem on claw-free chordal graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Complexity and approximation results for scheduling multiprocessor tasks on a ring
Discrete Applied Mathematics - International symposium on combinatorial optimisation
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
Journal of Scheduling
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Discrete Applied Mathematics
A performance comparison of PSO and GA in scheduling hybrid flow-shops with multiprocessor tasks
Proceedings of the 2008 ACM symposium on Applied computing
A two-class parallel system with general service times of the parallel class
Journal of Computer and System Sciences
A Class of Graphs of f-Class 1
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Expert Systems with Applications: An International Journal
Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Parallel genetic algorithm for a flow-shop problem with multiprocessor tasks
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Performance of particle swarm optimization in scheduling hybrid flow-shops with multiprocessor tasks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Minimum cost edge-colorings of trees can be reduced to matchings
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Metaheuristic methods in hybrid flow shop scheduling problem
Expert Systems with Applications: An International Journal
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit
Computers and Industrial Engineering
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
An M/M/2 parallel system model with pure space sharing among rigid jobs
Mathematical and Computer Modelling: An International Journal
CHECKCOL: Improved local search for graph coloring
Journal of Discrete Algorithms
| Hi-index | 14.99 |
The problem of diagnostic test scheduling (DTS) is to assign to each edge e of a diagnostic graph G a time interval of length l(e) so that intervals corresponding to edges at any given vertex do not overlap and the overall finishing time is minimum. In this correspondence we show that the DTS problem is NP-complete. Then we present a longest, first sequential scheduling algorithm which runs in worst case time O(dm log n) and uses O(m) space to produce a solution of length less than four times optimal. Then we show that the general performance bound can be strengthened to 3 * OPT(G) for low-degree graphs and to 2 ·OPT(G) in some special cases of binomial diagnostic graphs.