scientific article; zbMATH DE number 6157240
From MaRDI portal
Publication:4918387
zbMath1261.06003MaRDI QIDQ4918387
Publication date: 24 April 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (66)
A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ Constructing colorings for diagrams ⋮ Computing the jump number on semi-orders is polynomial ⋮ A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows ⋮ Treewidth of cocomparability graphs and a new order-theoretic parameter ⋮ Series-parallel posets and relative Ockham lattices ⋮ An Analytic Propositional Proof System on Graphs ⋮ Monotone labelings in polygonal tilings ⋮ On discrete optimization with ordering ⋮ On \(\text{CC}\)-comparability invariance of the fixed point property ⋮ `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders ⋮ Partially ordered knapsack and applications to scheduling ⋮ Interval approximations of message causality in distributed executions ⋮ Drawing and encoding two-dimensional posets ⋮ Parallel \(N\)-free order recognition ⋮ Triangulating multitolerance graphs ⋮ Software science view on quantum circuit algorithms ⋮ Handsome proof-nets: Perfect matchings and cographs ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ On-line chain partitions of up-growing semi-orders ⋮ Measuring the distance to series-parallelity by path expressions ⋮ On the approximability of average completion time scheduling under precedence constraints. ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Understanding the generalized median stable matchings ⋮ On the order dimension of outerplanar maps ⋮ Non-commutative logic. III: Focusing proofs. ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Tackling the jump number of interval orders ⋮ Transitive closure for restricted classes of partial orders ⋮ Distances in cocomparability graphs and their powers ⋮ Counting linear extensions: parameterizations by treewidth ⋮ Parallel interval order recognition and construction of interval representations ⋮ Cross-series-parallel digraphs ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ A linear time and space algorithm to recognize interval orders ⋮ Cyclic Extensions of Order Varieties ⋮ Retractions onto series-parallel posets ⋮ On estimating the number of order ideals in partial orders, with some applications ⋮ On Maltsev digraphs ⋮ Unnamed Item ⋮ Scheduling tasks on a flexible manufacturing machine to minimize tool change delays ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ The monadic second-order logic of graphs. XV: On a conjecture by D. Seese ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ Non-commutative proof construction: a constraint-based approach ⋮ Minimizing the number of tardy jobs with precedence constraints and agreeable due dates ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Confluent Hasse Diagrams ⋮ Unnamed Item ⋮ Single machine precedence constrained scheduling is a Vertex cover problem ⋮ Computational complexity of some scheduling problems with multiprocessor tasks ⋮ On-line chain partitions of orders: a survey ⋮ Algorithms for the fixed point property ⋮ Entropy conservation for comparison-based algorithms ⋮ A new characterization of \(\mathcal{V} \)-posets ⋮ A faster tree-decomposition based algorithm for counting linear extensions ⋮ Miscellaneous Digraph Classes ⋮ Review of properties of different precedence graphs for scheduling problems ⋮ Counting Linear Extensions of Posets with Determinants of Hook Lengths ⋮ An algebra for pomsets. ⋮ Interval dimension is a comparability invariant ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems ⋮ Linear extensions of N-free orders.
This page was built for publication:
