Review of properties of different precedence graphs for scheduling problems (Q1847252): Difference between revisions

@@ Property / author @@
+Jacek Błażewicz
@@ Property / author: Jacek Błażewicz / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 520
@@ Property / describes a project that uses: Algorithm 520 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the linegraph of a directed-graph
@@ Property / cites work: On the linegraph of a directed-graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4380372
@@ Property / cites work: Q4380372 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Q4131987
@@ Property / cites work: Q4131987 / rank @@
+Normal rank
@@ Property / cites work @@
+Intransitive Indifference in Preference Theory: A Survey
+Normal rank
@@ Property / cites work @@
+A linear-time recognition algorithm for interval dags
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q3872508
@@ Property / cites work: Q3872508 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5345642
@@ Property / cites work: Q5345642 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of scheduling problems with typed task systems
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4918387
@@ Property / cites work: Q4918387 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Interval-Ordered Tasks
@@ Property / cites work: Scheduling Interval-Ordered Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling of interval orders is polynomial
+Normal rank
@@ Property / cites work @@
+Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
+Normal rank
@@ Property / cites work @@
+A labeling algorithm to recognize a line digraph and output its root graph
+Normal rank
@@ Property / cites work @@
+Q3676161
@@ Property / cites work: Q3676161 / rank @@
+Normal rank
@@ Property / cites work @@
+The jump number problem on interval orders: A 3/2 approximation algorithm
+Normal rank
@@ Property / cites work @@
+An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(01)00379-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2120730808
@@ Property / OpenAlex ID: W2120730808 / rank @@
+Normal rank