Digital Commons Network^™

A Bridge And Engine Room Staffing And Scheduling Model For Robust Mission Accomplishment In The Littoral Combat Ships, John P. Cordle

Engineering Management & Systems Engineering Projects for D. Eng. Degree

The Navy’s Littoral Combat Ships were designed to be relatively small surface vessels for operations near a littoral shore theater. These ships were envisioned to be highly automated, networked, agile, stealthy surface combatants capable of defeating anti-access and asymmetric threats in the littorals with minimum manpower. To date, however, some of these ships have experienced significant engineering and propulsion plant failures that impacted mission accomplishment and were attributable, at least in part, to under staffing and over scheduling the human component of the automation-human operational environment. The critical human components on the Littoral Combat Ship are bridge and engine room …

Resource Allocation In Vehicular Cloud Computing, Puya Ghazizadeh

Computer Science Theses & Dissertations

Recently, we have witnessed the emergence of Cloud Computing, a paradigm shift adopted by information technology (IT) companies with a large installed infrastructure base that often goes under-utilized. The unmistakable appeal of cloud computing is that it provides scalable access to computing resources and to a multitude of IT services. Cloud computing and cloud IT services have seen and continue to see a phenomenal adoption rate around the world.

Recently, Professor Olariu and his coworkers through series of research introduced a new concept, Vehicular Cloud Computing. A Vehicular Cloud (VC) is a network of vehicles in a parking lot …

Meta-Heuristics Analysis For Technologically Complex Programs: Understanding The Impact Of Total Constraints For Schedule, Quality And Cost, Henry Darrel Webb

Engineering Management & Systems Engineering Projects for D. Eng. Degree

Program management data associated with a technically complex radio frequency electronics base communication system has been collected and analyzed to identify heuristics which may be utilized in addition to existing processes and procedures to provide indicators that a program is trending to failure. Analysis of the collected data includes detailed schedule analysis, detailed earned value management analysis and defect analysis within the framework of a Firm Fixed Price (FFP) incentive fee contract.

This project develops heuristics and provides recommendations for analysis of complex project management efforts such as those discussed herein. The analysis of the effects of the constraints on …

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan

Engineering Management & Systems Engineering Theses & Dissertations

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due date-to-deadline window. ARSP assumes that the jobs have different release times, due dates, and due date-to-deadline windows between the refueling due date and a deadline to return without refueling. The Aerial Refueling Rescheduling Problem (ARRP), on the other hand, can be defined as updating the existing AR schedule after being disrupted by job related events including the …

Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez

Engineering Management & Systems Engineering Theses & Dissertations

The majority of scheduling research deals with problems in specific production environments with specific objective functions. However, in many cases, more than one problem type and/or objective function exists, resulting in the need for a more generic and flexible system to generate schedules. Furthermore, most of the published scheduling research focuses on creating an optimal or near optimal initial schedule during the planning phase. However, after production processes start, circumstances like machine breakdowns, urgent jobs, and other unplanned events may render the schedule suboptimal, obsolete or even infeasible resulting in a "rescheduling" problem, which is typically also addressed for a …

Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia

Engineering Management & Systems Engineering Theses & Dissertations

Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the …

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu

Electrical & Computer Engineering Theses & Dissertations

Due to its mild requirement on the bandwidth of switching fabric and internal memory, the input-queued architecture is a practical solution for today's very high-speed switches. One of the notoriously difficult problems in the design of input-queued switches with very high link rates is the high performance queueing and scheduling of multicast traffic. This dissertation focuses on proposing novel solutions for this problem. The design challenge stems from the nature of multicast traffic, i.e., a multicast packet typically has multiple destinations. On the one hand, this nature makes queueing and scheduling of multicast traffic much more difficult than that of …

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem

Engineering Management & Systems Engineering Faculty Publications

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …

A Robust Reactive Scheduling System With Application To Parallel Machine Scheduling, Jean-Paul M. Arnaout

Engineering Management & Systems Engineering Theses & Dissertations

In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms in a hospital, or employees in a company, while activities can be jobs in a manufacturing plant, surgeries in a hospital, or paper work in a company. The goal of each schedule is to optimize some performance measures, which could be the minimization of the schedule makespan, the jobs' completion times, jobs' earliness and tardiness, among …

A Fast Parallel Algorithm To Recognize P4-Sparse Graphs, Rong Lin, Stephan Olariu

Computer Science Faculty Publications

A number of problems in mobile computing, group-based collaboration, automated theorem proving, networking, scheduling, and cluster analysis suggested the study of graphs featuring certain “local density” characteristics. Typically, the notion of local density is equated with the absence of chordless paths of length three or more. Recently, a new metric for local density has been proposed, allowing a number of such induced paths to occur. More precisely, a graphG is called P4-sparse if no set of five vertices inG induces more than one chordless path of length three. P4-sparse graphs generalize the well-known class of cographs corresponding to …

Scalability In Real-Time Systems, Ramesh Yerraballi

Computer Science Theses & Dissertations

The number and complexity of applications that run in real-time environments have posed demanding requirements on the part of the real-time system designer. It has now become important to accommodate the application complexity at early stages of the design cycle. Further, the stringent demands to guarantee task deadlines (particularly in a hard real-time environment, which is the assumed environment in this thesis) have motivated both practioners and researchers to look at ways to analyze systems prior to run-time. This thesis reports a new perspective to analyzing real-time systems that in addition to ascertaining the ability of a system to meet …

An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu

Computer Science Faculty Publications

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.

A Comparison Of Alphanumeric, Direct Manipulation Graphic, And Equivalent Interface Design For A Production Scheduling Task, Ann C. Fulop

Psychology Theses & Dissertations

Scheduling is an essential factor influencing the efficiency of any production system. The effectiveness of the scheduling system depends upon the interaction of the human and machine. Thus, to effectively design the interface between the human and the machine, the human factors professional must understand scheduling behavior and the information requirements of the scheduling task. The present study modeled human scheduling behavior and determined the information requirements of the scheduling task. The study also compared alphanumeric, direct manipulation graphic, and equivalent interfaces to determine which interface best supports scheduling. The results of the study show that schedulers monitor the current …