Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2013.06.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2012468641
@@ Property / OpenAlex ID: W2012468641 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time on a batch processing machine with job families
+Normal rank
@@ Property / cites work @@
+Efficient scheduling algorithms for a single batch processing machine
+Normal rank
@@ Property / cites work @@
+A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / 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
@@ Property / cites work @@
+Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
+Normal rank
@@ Property / cites work @@
+Makespan minimization on single batch-processing machine via ant colony optimization
+Normal rank
@@ Property / cites work @@
+Q4873242
@@ Property / cites work: Q4873242 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank