Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217): Difference between revisions

@@ Property / DOI @@
-.1002/nav.4
@@ Property / DOI: 10.1002/nav.4 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.4
@@ Property / full work available at URL: https://doi.org/10.1002/nav.4 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2150171969
@@ Property / OpenAlex ID: W2150171969 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time on a batch processing machine with job families
+Normal rank
@@ Property / cites work @@
+Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
+Normal rank
@@ Property / cites work @@
+Efficient scheduling algorithms for a single batch processing machine
+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 @@
+Scheduling with agreeable release times and due dates on a batch processing machine
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a single batch processing machine with non-identical job sizes
+Normal rank
@@ Property / DOI @@
+.1002/NAV.4
@@ Property / DOI: 10.1002/NAV.4 / rank @@
+Normal rank