An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-007-9128-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2798229098
@@ Property / OpenAlex ID: W2798229098 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batch processing machine with non-identical job sizes
+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 @@
+Minimizing mean completion time in a batch processing system
+Normal rank
@@ Property / cites work @@
+Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batching machine with release times and non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a single batch processing machine with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with nonidentical job sizes
+Normal rank