Sequencing Problems in Two-Server Systems

摘要: We analyze a service system in which two identical servers move one at time along linear array of N positions. Requests for service, each designating the positions, join first-in-first-out queue, where processing nth request does not begin until (n − 1)th requested is completed. Processing entails determining server to move, moving this position, and then performing service. Several potential applications model are mentioned, most notable being design computer storage systems with multiple access devices. Within simple probability we compare server-selection policies terms equilibrium expected distance moved request. Distance measured under regimes, both assigning unit between adjacent In first, positions thought as equally spaced line (interval), second, circle (positi...