Rapid prototyping of integrated taxiway and runway schedulers at airports has become highly desirable for Safe and Efficient Surface Operations (SESO) to support the Next Generation Air Transportation System (NextGen). Finding optimal solutions for taxiway and runway scheduling are generally computationally difficult and therefore it is essential to develop fast algorithms that can produce high...

In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-l...

The fuzzy sets possess natural capability to capture measurement uncertainty as a part of experimental data. Therefore the uncertainties of various kinds involved in system failure analysis may be adequately addressed using the concept of fuzzy sets. Fonseca et al developed and implemented fuzzy reasoning algorithm via an expert system to assess the likelihood of equipment failure mode. The alg...

In earlier work we have introduced an efficient hardware fault-tolerant approach for reliable execution of tasks. The proposed approach called the Hardware Fault-Tolerant (HFT) approach. Also, we have introduced the concept of dynamic group maximum matching, which is used to group nodes of a graph into disjoint groups with different sizes dynamically. Furthermore, we have proposed the Dynamic G...

We develop two classes of optimization models to maximize revenue in a restaurant (while controlling average waiting time as well as perceived fairness) that may violate the first-come-first-serve (FCFS) rule. In the first class of models, we use integer programming, stochastic programming, and approximate dynamic programming methods to decide dynamically when, if at all, to seat an incoming pa...

First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web requests and so on. We also have orthogonal applications of FCFS policies in proving correctness of search algorithms such as Breadth-First Search and the Bellman-Ford FIFO implementation for finding single-source shor...

15 Acknowledgement We wish to thank two anonymous referees for their helpful comments. Single machine scheduling with dynamic arrivals: Decomposition results and a forward algorithm. 14 (columns 4{6). In column 2, maxit is the maximum number of neighborhood searches allowed. Column 4 lists the iteration when the observed best total completion time was found. The number of times the aspiration c...

Fairness queuing has recently been proposed as an e ective way to insulate users of large computer communication datagram networks from congestion caused by the activities of other (possibly ill-behaved) users. Unfortunately, fair queuing as proposed by Shenker et al. [DKS89] requires that each conversationz be mapped into its own queue. While there are many known methods of implementing this t...

In all non-blocking non-preemptive (NBNP) scheduling techniques for a multicomputer system for processor allocation, Largest-Job-First (LJF) technique proves to possess a unique characteristic in utilizing as many processors as possible compared to others such as First-Come-First-Serve (FCFS) and Smallest-Job-First (SJF). However, a jobbypass limit that is preset to preclude the starvation prob...

One of the most significant and the topmost parameters in the real world computing environment is energy. Minimizing energy imposes benefits like reduction in power consumption, decrease in cooling rates of the computing processors, provision of a green environment, and so forth. In fact, computation time and energy are directly proportional to each other and the minimization of computation tim...