Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395): Difference between revisions

@@ Property / author @@
-Guohua Wan
@@ Property / author: Guohua Wan / rank @@
-Normal rank
@@ Property / author @@
-Benjamin P.-C. Yen
@@ Property / author: Benjamin P.-C. Yen / rank @@
-Normal rank
@@ Property / author @@
-Chung-Lun Li
@@ Property / author: Chung-Lun Li / rank @@
-Normal rank
@@ Property / author @@
+Guohua Wan
@@ Property / author: Guohua Wan / rank @@
+Normal rank
@@ Property / author @@
+Benjamin P.-C. Yen
@@ Property / author: Benjamin P.-C. Yen / rank @@
+Normal rank
@@ Property / author @@
+Chung-Lun Li
@@ Property / author: Chung-Lun Li / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
+Normal rank
@@ Property / cites work @@
+A survey of results for sequencing problems with controllable processing times
+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 / Wikidata QID @@
+Q127251377
@@ Property / Wikidata QID: Q127251377 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1603395