MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963): Difference between revisions

@@ Property / cites work @@
+The complexity of one-machine batching problems
@@ Property / cites work: The complexity of one-machine batching problems / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873242
@@ Property / cites work: Q4873242 / rank @@
+Normal rank
@@ Property / cites work @@
+One-machine batching and sequencing of multiple-type items
+Normal rank
@@ Property / cites work @@
+Batch scheduling to minimize maximum lateness
@@ Property / cites work: Batch scheduling to minimize maximum lateness / rank @@
+Normal rank
@@ Property / cites work @@
+A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
+Normal rank
@@ Property / cites work @@
+Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
+Normal rank
@@ Property / cites work @@
+Scheduling unrelated parallel batch processing machines with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+On the Complexity of Scheduling with Batch Setup Times
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study
+Normal rank
@@ Property / cites work @@
+Scheduling Groups of Jobs on a Single Machine
@@ Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank @@
+Normal rank