The following pages link to (Q4918387):
Displaying 50 items.
- On discrete optimization with ordering (Q367635) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- On the order dimension of outerplanar maps (Q651434) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- A linear time and space algorithm to recognize interval orders (Q689975) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- A new characterization of \(\mathcal{V} \)-posets (Q781541) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
- Tackling the jump number of interval orders (Q1182058) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- Constructing colorings for diagrams (Q1329806) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Series-parallel posets and relative Ockham lattices (Q1344248) (← links)
- Monotone labelings in polygonal tilings (Q1356633) (← links)
- On \(\text{CC}\)-comparability invariance of the fixed point property (Q1377719) (← links)
- Drawing and encoding two-dimensional posets (Q1392206) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Handsome proof-nets: Perfect matchings and cographs (Q1398476) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- Non-commutative logic. III: Focusing proofs. (Q1427855) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- An algebra for pomsets. (Q1854275) (← links)
- On-line chain partitions of up-growing semi-orders (Q1943698) (← links)
- Understanding the generalized median stable matchings (Q1959721) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- Entropy conservation for comparison-based algorithms (Q2077296) (← links)
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- Linear extensions of N-free orders. (Q2351714) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Retractions onto series-parallel posets (Q2483392) (← links)
