An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2013.01.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1979238414
@@ Property / OpenAlex ID: W1979238414 / 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 @@
+The Batch Loading and Scheduling Problem
@@ Property / cites work: The Batch Loading and Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
+Normal rank
@@ Property / cites work @@
+A flexible on-line scheduling algorithm for batch machine with infinite capacity
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in batch machine scheduling
@@ Property / cites work: Minimizing makespan in batch machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On-line algorithms for minimizing makespan on batch processing machines
+Normal rank