A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730): Difference between revisions

@@ Property / cites work @@
+Control of a batch-processing machine: A computational approach
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
+Normal rank
@@ Property / cites work @@
+Scheduling one batch processor subject to job release dates
+Normal rank
@@ Property / cites work @@
+On-line scheduling algorithms for a batch machine with finite capacity
+Normal rank
@@ Property / cites work @@
+Online scheduling on unbounded parallel-batch machines to minimize the makespan
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0217595914500304
+Normal rank
@@ Property / OpenAlex ID @@
+W2124860803
@@ Property / OpenAlex ID: W2124860803 / rank @@
+Normal rank