Developing feasible and optimal schedules of jobs on one machine (Q380659): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-012-9392-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2063081335
@@ Property / OpenAlex ID: W2063081335 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing with due-dates and early start times to minimize maximum tardiness
+Normal rank
@@ Property / cites work @@
+On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
+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 note on minimizing maximum lateness in a one-machine sequencing problem with release dates
+Normal rank
@@ Property / cites work @@
+A block approach for single-machine scheduling with release dates and due dates
+Normal rank
@@ Property / cites work @@
+Computer-Aided complexity classification of combinational problems
+Normal rank
@@ Property / cites work @@
+Certain properties of scheduling problems
@@ Property / cites work: Certain properties of scheduling problems / rank @@
+Normal rank