We solve the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows to minimize customer waiting time and server overtime costs. We study the problem in fluid and diffusion frameworks. We find that it is optimal to schedule traffic so that the system is in critical load. That is, heavy-traffic is obtained as a result of optimization rath...

Age of information is a newly proposed metric that captures the freshness of information at end-users. The age measures the amount of time that elapsed since the latest information was generated at a source. In this context, we study an age minimization problem over a wireless broadcast network to keep many users updated on timely information, where only one user can be served at a time. We for...

Work-conserving disciplines may be implemented with the use of scheduling calendars. Since calendars have finite resolutions, theoretical emission times that determine the positions of frames within the calendar slots have to be rounded to match the boundaries of the slots. The selection of a rounding method affects the performance of a work-conserving discipline. In this paper, we present an e...

This paper presented memory footprint and combinational complexity for two dimensional finite impulse response (FIR) filter to get the systematic design strategy to obtain areadelay-power-efficient architectures. Based on the memory sharing and memory-reuse along with suitable scheduling of computational design of storage architecture the separable and nonseparable filters with less memory foot...

In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

A particularly difficult class of scheduling and routing problems involves an objective that is a sum of time-varying action costs, which increases the size and complexity of the problem. Solve-and-improve approaches, which find an initial solution for a simplified model and improve it using a cost function, and Mixed Integer Programming (MIP) are often used for solving such problems. However, ...

Scheduling in wireless networks plays an important role. The undetermined nature of the wireless channel is usually considered as an undesirable property. Recently, the idea of opportunistic scheduling is introduced and it takes advantage of the time-varying channel for performance improvement such as throughput and delay. Since the introduction of opportunistic scheduling, there are two main b...

Modern wireless cellular systems are able to utilize the opportunistic scheduling gain originating from the variability in the users’ channel conditions. By favoring users with good instantaneous channel conditions, the service capacity of the system can be increased with the number of users. On the other hand, for service systems with fixed service capacity, the system performance can be optim...