Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563): Difference between revisions

@@ Property / cites work @@
+Single machine scheduling with discretely controllable processing times
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
+Normal rank
@@ Property / cites work @@
+The discrete time-cost tradeoff problem revisited
@@ Property / cites work: The discrete time-cost tradeoff problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
+Normal rank
@@ Property / cites work @@
+Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+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 survey of results for sequencing problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
+Normal rank
@@ Property / cites work @@
+A bicriterion approach to time/cost trade-offs in sequencing
+Normal rank
@@ Property / cites work @@
+Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
+Normal rank