Common due date assignment and scheduling with ready times (Q1867095): Difference between revisions

@@ Property / author @@
-Cheng, T. C. Edwin
@@ Property / author: Cheng, T. C. Edwin / rank @@
-Normal rank
@@ Property / author @@
-Zhi-Long Chen
@@ Property / author: Zhi-Long Chen / rank @@
-Normal rank
@@ Property / author @@
-Natalia V. Shakhlevich
@@ Property / author: Natalia V. Shakhlevich / rank @@
-Normal rank
@@ Property / author @@
+Cheng, T. C. Edwin
@@ Property / author: Cheng, T. C. Edwin / rank @@
+Normal rank
@@ Property / author @@
+Zhi-Long Chen
@@ Property / author: Zhi-Long Chen / rank @@
+Normal rank
@@ Property / author @@
+Natalia V. Shakhlevich
@@ Property / author: Natalia V. Shakhlevich / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing average completion time in the presence of release dates
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
+Normal rank