scientific article; zbMATH DE number 871903
From MaRDI portal
zbMath0845.90072MaRDI QIDQ4875172
Publication date: 28 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items
Transactional contention management as a Non-clairvoyant scheduling problem, Improving lower bounds for equitable chromatic number, Equitable distinguishing chromatic number, Models and complexity of multibin packing problems, Equitable colorings of Kronecker products of graphs, On chromatic sums and distributed resource allocation, \((N, p)\)-equitable \(b\)-coloring of graphs, Window-based greedy contention management for transactional memory: theory and practice, Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization, The mutual exclusion scheduling problem for permutation and comparability graphs., A competitive analysis for balanced transactional memory workloads, Probabilistic analysis for scheduling with conflicts, Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, The equitable vertex arboricity of complete tripartite graphs, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, Approximation algorithms for time constrained scheduling, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, On the equitable vertex arboricity of graphs, On the equitable vertex arboricity of complete tripartite graphs, Buffer minimization with conflicts on a line, An approximation scheme for bin packing with conflicts, Equitable defective coloring of sparse planar graphs, Equitable colorings of Cartesian products of graphs, Equitable colorings of bounded treewidth graphs, On equitable \(\Delta\)-coloring of graphs with low average degree
