Minimizing Variation of Flow Time in Single Machine Systems
Citations
979 citations
165 citations
154 citations
133 citations
Cites methods from "Minimizing Variation of Flow Time i..."
...Kanet [8] showed the model as being applicable to any service and manufacturing setting where it is desirable to provide customers or jobs with approximately the same service....
[...]
131 citations
Cites background from "Minimizing Variation of Flow Time i..."
...Kanet (1981), provides a detailed discussion on the number of optimal solutions for the 1kTADC problem....
[...]
...As was first shown by Kanet (1981), TADC ¼ Xn i¼1 Xn j¼i jCj Cij ¼ Xn r¼1 ðr 1Þðn r þ 1Þðs½r þ p½r Þ ¼ Xn r¼1 " ðr 1Þðn r þ 1Þ þ c Xn j¼rþ1 ðj 1Þðn jþ 1Þ # p½r : ð4Þ As in the case of Eqs....
[...]
References
187 citations
"Minimizing Variation of Flow Time i..." refers background or methods in this paper
...The sample problems used were the seven problems from [1] for which data were available....
[...]
...In addition, a new heuristic is described for minimizing flow time variance and its performance is compared to the heuristics of Eilon and Chowdhury [1]....
[...]
...The procedure compares favorably to the best alternatives given by Eilon and Chowdhury [1]....
[...]
...Eilon and Chowdhury [1] strengthen the results of Schrage by showing that optimal flow time variance schedules must be V-shaped....
[...]
...1 of Eilon and Chowdhury [1]....
[...]
169 citations
"Minimizing Variation of Flow Time i..." refers background in this paper
...As Merton and Muller [3] indicate, in computer systems with large data sets the response time to a user's request is often strongly dependent on the file-access time....
[...]
...In the earliest paper on this topic, Merton and Muller [3] analyze the relation between flow time variance and waiting time variance....
[...]
..., [1], [3], and [4]) and no theoretical breakthrough is claimed here....
[...]
113 citations
"Minimizing Variation of Flow Time i..." refers background or methods in this paper
...The solutions indicated by an asterisk (*) have been shown by Schrage [4] to be optimal....
[...]
...In [4], Schrage demonstrates that for n = 6 one simply cannot specify the optimal solution based on some order of the job processing times....
[...]
...It is known from Schrage [4] that property I is necessary for minimum variance of completion times....
[...]
..., [1], [3], and [4]) and no theoretical breakthrough is claimed here....
[...]
...Method E&C is based on the conjecture by Schrage [4] that for n jobs, there exists an optimal sequence of the form S= {1,3,4,???,2}....
[...]