A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2009.02.007
@@ Property / DOI: 10.1016/j.ipl.2009.02.007 / rank @@
-Normal rank
@@ 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 @@
+A multiple-criterion model for machine scheduling
@@ Property / cites work: A multiple-criterion model for machine scheduling / rank @@
+Normal rank
@@ 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 @@
+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 @@
+Q3070927
@@ Property / cites work: Q3070927 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicriteria scheduling
@@ Property / cites work: Multicriteria scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2009.02.007
@@ Property / DOI: 10.1016/J.IPL.2009.02.007 / rank @@
+Normal rank