Minimizing completion time variance with compressible processing times (Q1781972): Difference between revisions

@@ Property / DOI @@
-.1007/s10898-004-5703-y
@@ Property / DOI: 10.1007/s10898-004-5703-y / 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/s10898-004-5703-y
+Normal rank
@@ Property / OpenAlex ID @@
+W1988647270
@@ Property / OpenAlex ID: W1988647270 / rank @@
+Normal rank
@@ Property / cites work @@
+Two parallel machine sequencing problems involving controllable job processing times
+Normal rank
@@ Property / cites work @@
+Mimimization of agreeably weighted variance in single machine systems
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
+Normal rank
@@ Property / cites work @@
+On the Minimization of Completion Time Variance with a Bicriteria Extension
+Normal rank
@@ Property / cites work @@
+Minimising Waiting Time Variance in the Single Machine Problem
+Normal rank
@@ Property / cites work @@
+Completion time variance minimization on a single machine is difficult
+Normal rank
@@ Property / cites work @@
+Variance Minimization in Single Machine Sequencing Problems
+Normal rank
@@ Property / cites work @@
+A tight lower bound for the completion time variance problem
+Normal rank
@@ Property / cites work @@
+A two-machine flow shop scheduling problem with controllable job processing times
+Normal rank
@@ Property / cites work @@
+A survey of results for sequencing problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+Single-machine sequencing with controllable processing times
+Normal rank
@@ Property / DOI @@
+.1007/S10898-004-5703-Y
@@ Property / DOI: 10.1007/S10898-004-5703-Y / rank @@
+Normal rank