Online batch scheduling on parallel machines with delivery times (Q719274): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.06.011
+Normal rank
@@ Property / OpenAlex ID @@
+W1970812428
@@ Property / OpenAlex ID: W1970812428 / 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 @@
+A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
+Normal rank
@@ Property / cites work @@
+On-line scheduling with delivery time on a single batch machine
+Normal rank
@@ Property / cites work @@
+Online scheduling on unbounded parallel-batch machines to minimize the makespan
+Normal rank
@@ Property / cites work @@
+Q4368485
@@ Property / cites work: Q4368485 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line algorithms for minimizing makespan on batch processing machines
+Normal rank