Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints (Q1610141): Difference between revisions

@@ Property / cites work @@
+Relocation problems are hard
@@ Property / cites work: Relocation problems are hard / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing with Earliness and Tardiness Penalties: A Review
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Survey of scheduling research involving due date determination decisions
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A fast feasibility test for relocation problems
@@ Property / cites work: A fast feasibility test for relocation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Relocation problems of maximizing new capacities under a common due date
+Normal rank
@@ Property / cites work @@
+Generating the best \(K\) sequences in relocation 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 @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(98)00196-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2093964466
@@ Property / OpenAlex ID: W2093964466 / rank @@
+Normal rank