P.C. Jones, T. J. Lowe, G. Muller, N. Xu, Y. Ye, and J. L. Zydiak, "Specially structured uncapacitated facility location problem," Operations Research, Vol. 43, No. 4, July-August 1995, pp. 661-669.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....presented in Section 3. But for the facility location problem, in general, researchers adopt optimization criteria that are related to the physical distances between plants and facilities in either a continuous or discrete domain without any prioritizing schemes or deadline related factors (e.g. [4, 6, 9, 11, 14]) Thus, although lessons can be drawn from the design of algorithms for different versions of the facility location problem, there are no obvi ous direct correlations between either the formulations or the potential solutions of those two problems. Data management problems similar to data ....

.... contingent vertex V[r] is defined as Drq[i,r] For any element drq Drq[i,r] drq is an integer (0 drq Nrq[i] such that V[Request[i,drq] VD[i] For the example shown in Figure 2(a) for V[3] corresponding to M[3] Drq[0,3] 0, 1, 2 corresponding to requests for [0] from M[7] M[8] and M[9], respectively. For V[2] corresponding to M[2] Drq[0,2] 3 corresponding to the request for [0] from M[6] Similarly, for the example shown in Figure 2(b) Drq[1,3] 0 corresponding to the request of [1] from M[8] Drq[1,5] 1 corresponding to the request of [1] from M[9] and Drq[1,4] ....

[Article contains additional citation context not shown here]

P.C. Jones, T. J. Lowe, G. Muller, N. Xu, Y. Ye, and J. L. Zydiak, "Specially structured uncapacitated facility location problem," Operations Research, Vol. 43, No. 4, July-August 1995, pp. 661-669.

....collected so far and stay fixed throughout the scheduling process. This paper summarizes some of the material in [10, 11] and corresponds to the keynote presentation H. J. Siegel will give at the conference. The ways in which the research presented here differs from related work (e.g. [1, 2, 3, 4, 6, 7, 8, 9, 12] is discussed in [10, 11] Three multiple source shortest path algorithm based heuristics for finding a near optimal schedule of the communication steps for staging the data are presented. Each heuristic could be used with each of seven cost criteria developed. The first four cost criteria were ....

P. C. Jones, T. J. Lowe, G. Muller, N. Xu, Y. Ye, and J. L. Zydiak, "Specially structured uncapacitated facility location problem," Operations Research, Vol. 43, No. 4, July-Aug. 1995, pp. 661-669.

....a heuristic for solving it. Due to space constraints, the reader is referred to [17] for a more thorough discussion of the related work. A problem that is, at a high level, remotely similar to data staging is the facility location problem in management science and operations research (e.g. [9]) Data management problems similar to data staging for the BADD program are studied for other communication systems [1, 2, 4, 8] Other areas that are somewhat related include modifying routing schemes [3] mapping tasks onto a suite of distributed heterogeneous machines (e.g. 5, 6, 18] and ....

....the next machine on the shortest path allows this copy to be used as an intermediate copy for forwarding Rq[i] to some other machines. For the example communication step of transferring Rq[0] from M [0] to M [3] shown in Figure 1(a) by tracing the shortest paths generated for M [7] M [8] and M [9], the set of intermediate machines can be determined as f3, 5g. At some time duration after the latest deadline for Rq[i] as discussed in Section 3, the available memory capacity of M [r] is incremented by j Rq[i] j to simulate the removal of Rq[i] from its memory. So for the example, M [3] and M ....

[Article contains additional citation context not shown here]

P. C. Jones, T. J. Lowe, G. Muller, N. Xu, Y. Ye, and J. L. Zydiak, "Specially structured uncapacitated facility location problem," Operations Research, Vol. 43, No. 4, July-Aug. 1995, pp. 661-669.

....in Section 3. But for the facility location problem, in general, researchers adopt optimization criteria that are related to the physical distances between plants and facilities in either a continuous or discrete domain without any prioritizing schemes or individual deadline related factors (e.g. [ChD81, CoN80, JoL95, MoC84, Shi77]) Furthermore, in the facility location problem all constraints must be satisfied for the production to occur (e.g. all parts of a car must arrive) In this research, it is known that not all requests can be satisfied (e.g. some low priority data requests may be dropped) Thus, although lessons ....

P. C. Jones, T. J. Lowe, G. Muller, N. Xu, Y. Ye, and J. L. Zydiak, "Specially structured uncapacitated facility location problem," Operations Research, Vol. 43, No. 4, July-August 1995, pp. 661-669.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC