A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331939308843913
+Normal rank
@@ Property / OpenAlex ID @@
+W2069989525
@@ Property / OpenAlex ID: W2069989525 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
+Normal rank
@@ Property / cites work @@
+Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
+Normal rank
@@ Property / cites work @@
+Q3320091
@@ Property / cites work: Q3320091 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with release dates to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Minimizing Weighted Completion Times with Deadlines
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
+Normal rank