The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087): Difference between revisions

@@ Property / cites work @@
+Q2734595
@@ Property / cites work: Q2734595 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for resource-constrained project scheduling problems.
+Normal rank
@@ Property / cites work @@
+Batch sizing and job sequencing on a single machine
+Normal rank
@@ Property / cites work @@
+Q2729097
@@ Property / cites work: Q2729097 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling one batch processor subject to job release dates
+Normal rank
@@ Property / cites work @@
+On scheduling an unbounded batch machine
@@ Property / cites work: On scheduling an unbounded batch machine / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank