Development and demonstration of an on-board mission planner for helicopters

Mission management tasks can be distributed within a planning hierarchy, where each level of the hierarchy addresses a scope of action, and associated time scale or planning horizon, and requirements for plan generation response time. The current work is focused on the far-field planning subproblem, with a scope and planning horizon encompassing the entire mission and with a response time required to be about two minutes. The far-feld planning problem is posed as a constrained optimization problem and algorithms and structural organizations are proposed for the solution. Algorithms are implemented in a developmental environment, and performance is assessed with respect to optimality and feasibility for the intended application and in comparison with alternative algorithms. This is done for the three major components of far-field planning: goal planning, waypoint path planning, and timeline management. It appears feasible to meet performance requirements on a 10 Mips flyable processor (dedicated to far-field planning) using a heuristically-guided simulated annealing technique for the goal planner, a modified A* search for the waypoint path planner, and a speed scheduling technique developed for this project

Project scheduling under undertainty – survey and research potentials.

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, stochastic GERT network scheduling, fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling projects under uncertainty.Management; Project management; Robustness; Scheduling; Stability;

A branch-and-bound algorithm for stable scheduling in single-machine production systems.

Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise. This paper proposes a branch-and-bound algorithm for optimally solving a single-machine scheduling problem with stability objective, when a single job is anticipated to be disrupted.Branch-and-bound; Construction; Event; Job; Robust scheduling; Robustness; Scheduling; Single-machine scheduling; Stability; Systems; Uncertainty;

Supplier Choice: Market Selection under Uncertainty.

Suppliers and Manufacturers generally have some say in which subset of all possible demand they will meet. In some cases that choice is implicit through pricing decisions and feature selection. Other times it is made explicitly by choosing only specific regions to stock a product in. This thesis includes models using both approaches and incorporates random demands. We present several methods for choosing a subset of all candidate customers given uncertain demands. In this thesis we consider four models of demand selection. The first two research problems consider market selection, which has been studied in the literature. The Selective Newsvendor Problem (SNP) looks at a decision maker choosing a subset of candidate markets to serve, and then receiving revenues and paying newsvendor-type costs based on the selected collection. In this thesis we consider a generalization with normally distributed demands which includes a multi-period problem as a special case and develop both exact and heuristic algorithms to solve it. When demands are not normally distributed, the problem is considerably more complex and is in general NP-hard. We develop an approximation algorithm using sample average approximation and a rounding approach to efficiently solve the problem. In addition to the work on market selection, we propose two other models for demand selection. We study auctions as a tool for a supplier with a fixed capacity to allocate the limited supply to retailers with newsvendor-type costs. Finally, we present a model for a supplier who must ensure demand is met in all markets, but has the option to work with subsidiary suppliers to meet that demand.PhDIndustrial and Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/120864/1/zstrinka_1.pd

Hybrid Meta-Heuristics for Robust Scheduling

The production and delivery of rapidly perishable goods in distributed supply networks involves a number of tightly coupled decision and optimization problems regarding the just-in-time production scheduling and the routing of the delivery vehicles in order to satisfy strict customer specified time-windows. Besides dealing with the typical combinatorial complexity related to activity assignment and synchronization, effective methods must also provide robust schedules, coping with the stochastic perturbations (typically transportation delays) affecting the distribution process. In this paper, we propose a novel metaheuristic approach for robust scheduling. Our approach integrates mathematical programming, multi-objective evolutionary computation, and problem-specific constructive heuristics. The optimization algorithm returns a set of solutions with different cost and risk tradeoffs, allowing the analyst to adapt the planning depending on the attitude to risk. The effectiveness of the approach is demonstrated by a real-world case concerning the production and distribution of ready-mixed concrete.Meta-Heuristics;Multi-Objective Genetic Optimization;Robust Scheduling;Supply Networks

Algorithms for Scheduling Problems

This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more

A hierarchical framework for discrete event scheduling in manufacturing systems

Cover title. "Presented at the IIASA Workshop on Discrete Event Systems: Models and Applications. August 3-7, 1987. Sopron, Hungary."Includes bibliographical references.Supported by the Defense Advanced Research Projects Agency. N00014-85-K-0213by Stanley B. Gershwin