scientific article; zbMATH DE number 871903

MaRDI QIDQ4875172zbMATH OpenFDO

Authors Sandy Irani, Vitus J. Leung

Publication date 28 April 1996

zbMATH Keywords

conflict graphmaximum completion timehigh speed local area networkstraffic intersection control

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Recommendations

• Scheduling with conflicts on bipartite and interval graphs
• Probabilistic analysis for scheduling with conflicts
• Scheduling with conflicts: Online and offline algorithms
• Guaranteeing Fair Service to Persistent Dependent Tasks
• Improved bounds for scheduling conflicting jobs with minsum criteria

Cited in

(29)

• On equitable -coloring of graphs with low average degree
• Models and complexity of multibin packing problems
• Equitable colorings of Kronecker products of graphs
• Equitable colorings of bounded treewidth graphs
• Scheduling bidirectional traffic on a path
• On the equitable vertex arboricity of complete tripartite graphs
• Improving lower bounds for equitable chromatic number
• Equitable distinguishing chromatic number
• Traffic-light scheduling on the grid
• The equitable vertex arboricity of complete tripartite graphs
• On the equitable vertex arboricity of graphs
• On chromatic sums and distributed resource allocation
• The mutual exclusion scheduling problem for permutation and comparability graphs.
• Transactional contention management as a Non-clairvoyant scheduling problem
• Equitable colorings of Cartesian products of graphs
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• An approximation scheme for bin packing with conflicts
• Equitable defective coloring of sparse planar graphs
• Buffer minimization with conflicts on a line
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• \((N, p)\)-equitable \(b\)-coloring of graphs
• Probabilistic analysis for scheduling with conflicts
• scientific article; zbMATH DE number 910880 (Why is no real title available?)
• Window-based greedy contention management for transactional memory: theory and practice
• Approximation algorithms for time constrained scheduling
• Scheduling with conflicts on bipartite and interval graphs
• A competitive analysis for balanced transactional memory workloads
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875172)