Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

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

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 Apr 2011

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 …


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

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 …