A study of single-machine scheduling problem to maximize throughput (Q398860): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-012-0307-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2079322303
@@ Property / OpenAlex ID: W2079322303 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+A note on scheduling equal-length jobs to maximize throughput
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Parallel machine problems with equal processing times: a survey
+Normal rank
@@ Property / cites work @@
+Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
+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 @@
+A better algorithm for sequencing with release and delivery times on identical machines
+Normal rank
@@ Property / cites work @@
+Branch less, cut more and minimize the number of late equal-length jobs on identical machines
+Normal rank