Optimal on-line algorithms for one batch machine with grouped processing times (Q411231): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-010-9298-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2066466881
@@ Property / OpenAlex ID: W2066466881 / rank @@
+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 @@
+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 @@
+Scheduling one batch processor subject to job release dates
+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 scheduling with delivery time on a single batch machine
+Normal rank
@@ Property / cites work @@
+A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
+Normal rank
@@ Property / cites work @@
+On-line algorithms for minimizing makespan on batch processing machines
+Normal rank