Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.08.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2009153149
@@ Property / OpenAlex ID: W2009153149 / rank @@
+Normal rank
@@ 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 @@
+Approximation algorithms in batch processing
@@ Property / cites work: Approximation algorithms in batch processing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+A best online algorithm for scheduling on two parallel batch machines
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Scheduling one batch processor subject to job release dates
+Normal rank
@@ Property / cites work @@
+An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
+Normal rank
@@ Property / cites work @@
+A flexible on-line scheduling algorithm for batch machine with infinite capacity
+Normal rank
@@ Property / cites work @@
+On-line scheduling algorithms for a batch machine with finite capacity
+Normal rank
@@ Property / cites work @@
+On-line algorithms for minimizing makespan on batch processing machines
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:990962