Single machine scheduling with controllable processing times and compression costs. II: Proof and theorems (Q1288217): Difference between revisions

@@ Property / DOI @@
-.1007/s11766-998-0055-x
@@ Property / DOI: 10.1007/s11766-998-0055-x / rank @@
-Normal rank
@@ Property / author @@
-Les R. Foulds
@@ Property / author: Les R. Foulds / rank @@
-Normal rank
@@ Property / author @@
+Les R. Foulds
@@ Property / author: Les R. Foulds / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11766-998-0055-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2395535127
@@ Property / OpenAlex ID: W2395535127 / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
+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 / DOI @@
+.1007/S11766-998-0055-X
@@ Property / DOI: 10.1007/S11766-998-0055-X / rank @@
+Normal rank