Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988): Difference between revisions

@@ Property / cites work @@
+Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(96)00035-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2005924883
@@ Property / OpenAlex ID: W2005924883 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127646641
@@ Property / Wikidata QID: Q127646641 / rank @@
+Normal rank