Minimizing the number of late jobs when the start time of the machine is variable (Q1758276): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2012.05.006
@@ Property / DOI: 10.1016/j.orl.2012.05.006 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2012.05.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2027192197
@@ Property / OpenAlex ID: W2027192197 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Multicriteria scheduling
@@ Property / cites work: Multicriteria scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Necessary and sufficient conditions of optimality for some classical scheduling problems
+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 @@
+Multicriteria scheduling problems: a survey
@@ Property / cites work: Multicriteria scheduling problems: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the number of tardy jobs with stochastically-ordered processing times
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2012.05.006
@@ Property / DOI: 10.1016/J.ORL.2012.05.006 / rank @@
+Normal rank