A note on unbounded parallel-batch scheduling (Q495685): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2015.07.002
+Normal rank
@@ Property / OpenAlex ID @@
+W817947674
@@ Property / OpenAlex ID: W817947674 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
+Normal rank
@@ Property / cites work @@
+BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
+Normal rank
@@ Property / cites work @@
+Multicriteria scheduling
@@ Property / cites work: Multicriteria scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Q3378953
@@ Property / cites work: Q3378953 / rank @@
+Normal rank