Minimising makespan for two batch-processing machines with non-identical job sizes in job shop (Q2935125): Difference between revisions

@@ Property / cites work @@
+Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling problems with proportionally deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
+Normal rank
@@ Property / cites work @@
+A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
+Normal rank
@@ Property / cites work @@
+A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batching machine with release times and non-identical job sizes
+Normal rank
@@ Property / cites work @@
+A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Genetic algorithms to minimize the weighted number of late jobs on a single machine.
+Normal rank
@@ Property / cites work @@
+Scheduling a single batch processing machine with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with nonidentical job sizes
+Normal rank