Scheduling with incompatible jobs

References

Page 1

	Year	Citations
Bounds on Multiprocessing Timing Anomalies Ron Graham SIAM Journal on Applied Mathematics	1969	2.3K
Bounds for Certain Multiprocessing Anomalies Ronald Graham Bell System Technical Journal Mathematical ProgrammingComputational Complexity TheoryEngineeringComputer ArchitectureComputational Complexity	1966	1.6K
Using dual approximation algorithms for scheduling problems theoretical and practical results Dorit S. Hochbaum, David B. Shmoys Journal of the ACM Mathematical ProgrammingEngineeringAnalysis Of AlgorithmComputational ComplexityPractical Results	1987	770
Parallel machines scheduling with nonsimultaneous machine available time Chung‐Yee Lee Discrete Applied Mathematics EngineeringParallel MachinesScheduling ProblemComputer EngineeringComputer Architecture	1991	177
Precoloring extension. I. Interval graphs Miklós Bíró, Mihály Hujter, Zs. Tuza Discrete Mathematics Graph TheoryI. Interval GraphsInterval AnalysisInterval ComputationGraph Drawing	1992	157
Performance Guarantees for Scheduling Algorithms M. R. Garey, Ronald Graham, David S. Johnson Operations Research EngineeringSmart ManufacturingComputational ComplexityOperations ResearchSystems Engineering	1978	129
Worst-Case Analysis of Heuristic Algorithms Marshall L. Fisher Management Science Mathematical ProgrammingEngineeringMaximum DeviationWorst-case AnalysisHeuristic (Computer Science)	1980	126
Restrictions of graph partition problems. Part I Hans L. Bodlaender, Klaus Jansen Theoretical Computer Science Graph MinorGraph TheoryStructural Graph TheoryNetwork AnalysisGraph Partition Problems	1995	74
PRECOLORING EXTENSION. II. GRAPHS CLASSES RELATED TO BIPARTITE GRAPHS Mihály Hujter, Zs. Tuza	1993	67
Graph products and chromatic numbers Nathan Linial, Umesh Vazirani Graph ProductsEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	1989	47

Page 1