Search

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper extends the current state of public facilities location problems on a road network to cover situations in which the number of users at each node may be a random variable. The basic location model is reformulated as a chance-constrained programming problem with fractile criterion. A computational procedure for solving the non-linear deterministic equivalent problem derived is presented. Finally, a hypothetical numerical example illustrates the possibility of changes in the location decision when the stochastic nature of the problem is taken into account. [ABSTRACT FROM AUTHOR]

In this paper, a multi period task assignment problem is discussed. The objectives of this assignment problem include maximizing preference of operators towards the assigned tasks, maximizing the conformity of tasks with operators' skills and expertise, minimizing load variations over consecutive periods and maximizing the exposure of operators to different categories of tasks. A mathematical model based on goal programming is presented. To solve this multi period task assignment problem, a simulated annealing algorithm is proposed and illustrative examples are provided. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, two examples of memory hierarchies are examined: the cache or buffer system, and the virtual memory system. These examples are shown to differ mainly in the mapping function which determines where a given page may reside in the first level of the hierarchy. We also examine the operation of the replacement algorithm which determines the page to be removed from main storage when an absent page is referenced. The inclusion property associated with a class of replacement algorithms known as stack algorithms is described, and some examples of this class are presented. Some experimental observations on the effects of page size are presented, which indicate that page size is a parameter of fundamental importance to the performance of a storage hierarchy. The class of singly determined stack algorithms is then defined, and is shown to include both the popular Least Recently Used (LRU) replacement algorithm, and an optimal algorithm. Singly determined stack algorithms are then shown to have certain properties which could simplify an analysis of the effects of page size on the number of page faults experienced by a storage hierarchy. [ABSTRACT FROM AUTHOR]

Easily manipulated list structures for recording the basis tree for adjacent extreme point (“simplex type”) network algorithms are paramount to the development of computationally efficient network algorithms. This paper presents a new list structure which is shown to be computationally more efficient and to require one-third less computer memory to implement than all alternate list structures. [ABSTRACT FROM AUTHOR]

In this work, we address a double objective. In the first place, we study the problem of locating a single facility on a network N(V, E) which minimizes the sum of absolute differences between all pairs of weighted travel distances from the users to the facility, and we propose an O(|E||V|&sup 2;log|V|) algorithm for solving it. Likewise, we present a computational experience in which we compare the behavior of several equality measures by means of the placement of their respective optimal locations. To this end we define a measure of relative proximity between two optima, and we analyze the results obtained by considering several setting models of the network. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)