A procedure for the one-machine sequencing problem with dependent jobs (Q1130073): Difference between revisions

@@ Property / cites work @@
+The Shifting Bottleneck Procedure for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+A modified shifting bottleneck procedure for job-shop scheduling
+Normal rank
@@ Property / cites work @@
+Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness on one machine: computational experience and some applications
+Normal rank
@@ Property / cites work @@
+Q3940839
@@ Property / cites work: Q3940839 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with release dates to minimize maximum cost
+Normal rank