Semi-online early work maximization problem on two hierarchical machines with partial information of processing time (Q2151369): 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/978-3-030-93176-6_13
+Normal rank
@@ Property / OpenAlex ID @@
+W4206595953
@@ Property / OpenAlex ID: W4206595953 / rank @@
+Normal rank
@@ Property / cites work @@
+The hierarchical model for load balancing on two machines
+Normal rank
@@ Property / cites work @@
+Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling on two identical machines with a common due date to maximize total early work
+Normal rank
@@ Property / cites work @@
+Scheduling on parallel identical machines with late work criterion: offline and online cases
+Normal rank
@@ Property / cites work @@
+Optimal online algorithms for scheduling on two identical machines under a grade of service
+Normal rank
@@ Property / cites work @@
+Online and semi-online scheduling of two machines under a grade of service provision
+Normal rank
@@ Property / cites work @@
+Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2151369