Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes (Q3055315): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207540802010807
+Normal rank
@@ Property / OpenAlex ID @@
+W2047596610
@@ Property / OpenAlex ID: W2047596610 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
+Normal rank
@@ Property / cites work @@
+Efficient scheduling algorithms for a single batch processing machine
+Normal rank
@@ Property / cites work @@
+Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single burn-in oven in semiconductor manufacturing
+Normal rank
@@ Property / cites work @@
+Scheduling a single batch processing machine with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Dynamic scheduling of batch servers with compatible product families
+Normal rank