The Benefit of Information in a Single-server Queue with Heterogeneous Service Valuations [Abstract]

Aim/Purpose: How does heterogeneous valuation of service affect optimal control of queues? Background We analyze this heterogeneity by adding a component of travel costs, which differ with distance from the service point. Methodology: Mathematical analysis of queuing theory. Analyzing the anarchy function. Contribution: Enabling consumers to make optimal choices based on knowledge about their status, and enabling better control of the organizer. Findings: In the arrival rate is bounded, there is no need of interference. If it is unbounded then in many cases the organizer should impose the socially optimal queue length. Recommendations for Practitioners: In the arrival rate is bounded, there is no need of interference. If it is unbounded then in many cases the organizer should impose the socially optimal queue length. Recommendations for Researchers: Explore the following points: What happens when there are more than one server, located at different point. How should consumers behave, and what is the best way to locate service points. Impact on Society: Handling queues taking into account social welfare. Future Research: What happens when there are more than one server, located at different point. How should consumers behave, and what is the best way to locate service points.

On permutation policies for the scheduling of deteriorating stochastic jobs on a single machine

A single machine is available to process a collection of stochastic jobs. Processing is preemptive and so (for example) the machine is allowed to switch away from a job before completion, should that prove advantageous. The jobs are deteriorating in the sense that their processing requirements grow (at job-specific rates) as they await processing. This phenomenon might be expected to enhance the status of non-preemptive policies. The primary objective of the paper is to find conditions which are sufficient to ensure the existence of a permutation policy to minimise the expected makespan. We also derive results for a weighted flowtime criterion. Applications of such models to the control of queues and to communication systems have been cited by other authors.