ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On-line bin-stretching
@@ Property / cites work: On-line bin-stretching / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient fully polynomial approximation scheme for the Subset-Sum problem.
+Normal rank
@@ Property / cites work @@
+Capacitated two-parallel machines scheduling to minimize sum of job completion times
+Normal rank
@@ Property / cites work @@
+Current trends in deterministic scheduling
@@ Property / cites work: Current trends in deterministic scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Makespan minimization for two parallel machines with an availability constraint
+Normal rank
@@ Property / cites work @@
+Machine scheduling with availability constraints
@@ Property / cites work: Machine scheduling with availability constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with decreasing job sizes
@@ Property / cites work: Semi-online scheduling with decreasing job sizes / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-on-line problems on two identical machines with combined partial information
+Normal rank