The constrained minimum weighted sum of job completion times problem (Q2494511): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-005-0691-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2153966571
@@ Property / OpenAlex ID: W2153966571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252370
@@ Property / cites work: Q4252370 / rank @@
+Normal rank
@@ Property / cites work @@
+Slowing down sorting networks to obtain faster sorting algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Strongly polynomial-time approximation for a class of bicriteria problems.
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization with Rational Objective Functions
+Normal rank
@@ Property / cites work @@
+Structure of a simple scheduling polyhedron
@@ Property / cites work: Structure of a simple scheduling polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling Polyhedra with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q4829007
@@ Property / cites work: Q4829007 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+On the existence of schedules that are near-optimal for both makespan and total weighted completion time
+Normal rank