On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556): Difference between revisions

@@ 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 @@
+Complexity of single machine, multi-criteria scheduling problems
+Normal rank
@@ Property / cites work @@
+Minimizing number of tardy jobs on a batch processing machine with incompatible job families
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Q2743969
@@ Property / cites work: Q2743969 / rank @@
+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 @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Multiple and bicriteria scheduling: A literature survey
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted tardiness on a single batch process machine with incompatible job families
+Normal rank
@@ Property / cites work @@
+Scheduling batch processing machines with incompatible job families
+Normal rank