We study the optimal design of a professional service in mixed market customers with heterogeneous skills and capabilities using such service. Expert can avail on their own, whereas amateur find it challenging to deploy only procure through an intermediary who resolves technical issues. develop model that captures essential trade-offs settings: heterogeneity customer expertise, decentralization...

The increasing use of parallel systems has led to the development of a number of multiprogrammed processor allocation policies. This paper analyzes the following four policies that have previously been shown to have high performance under speciic workloads: adaptive static partitioning (ASP), dynamic rst-come-rst-serve (FCFS), preemptive smallest available parallelism rst (PSAPF), and spatial e...

Usually, Evolutionary Computation (EC) is used for optimisation and machine learning tasks. Recently, a novel use of EC has been proposed – Multiobjective Evolutionary Based Risk Assessment (MEBRA). MEBRA characterises the problem space associated with good and inferior performance of computational algorithms. Problem instances are represented (“scenario Representation”) and evolved (“scenario ...

Recently, the class of SMART scheduling policies has been introduced in order to formalize the common heuristic of “biasing toward small jobs.” We study the tail of the sojourn-time (response-time) distribution under both SMART policies and the Foreground-Background policy (FB) in the GI/GI/1 queue. We prove that these policies behave very well under heavy-tailed service times. Specifically, we...

We consider the FCFS GI/GI/n queue in the so-called HalfinWhitt heavy traffic regime. We prove that under minor technical conditions the associated sequence of steady-state queue length distributions, normalized by n 1 2 , is tight. We derive an upper bound on the large deviation exponent of the limiting steady-state queue length matching that conjectured by Gamarnik and Momcilovic in [16]. We ...

In personalized queues, information at the level of individuals – customers or servers – is affecting system dynamics. Such information is becoming increasingly accessible, directly or statistically, as exemplified by personalized/precision medicine (customers) or call-center workforce management (servers). In the present work, we take advantage of personalized information about customers, spec...

Task scheduling is essential for the suitable operation of multiprocessor systems. The task scheduling is prime significance of multiprocessor parallel systems. In this paper, an efficient method based on genetic algorithms is developed to solve the multiprocessor scheduling problem. The paper also aims to provide a comparative study of incorporating heuristics such as ‘Earliest Deadline First ...

A parallel packet switch (PPS) is a switch in which the memories run slower than the line rate. Arriving packets are spread (or load-balanced) packet-by-packet over multiple slower-speed packet switches. It is already known that with a speedup of , a PPS can theoretically mimic a FCFS output-queued (OQ) switch. However, the theory relies on a centralized packet scheduling algorithm that is esse...

In this paper, we address the medium-access control (MAC) problem in systems with multiple destinations, a problem that is crucial to the development of ad hoc networks. We focus on collision-resolution algorithms, specifically on First-Come, First-Serve (FCFS) splitting algorithms. We illustrate the difficulties that arise because of the interference between two populations of nodes that share...

This paper presents an optimization model for an aircraft taxi-scheduling problem that arises on the surface of airports. Though formulations are already available for this problem in the literature, they either ignore aircraft type or do not include all the safety constraints that are required to keep any two aircraft separated by a minimum distance at any time instant. The proposed model impr...