Scheduling of Manufacturing Systems

Document Type

Presentation Abstract

Presentation Date

12-14-2000

Abstract

A model of a `flexible manufacturing system' under such scheduling policies as `clearing' or `first come, first served' gives an interesting class of dynamical systems. Formerly, it was conjectured that a simple capacity condition sufficed to ensure stability [boundedness, uniform in t, for the state for any initial conditions]. However, it has been possible to construct examples, for each of these policies, which are unstable even though the natural capacity condition is satisfied. On the other hand, for simple flow geometries it is possible to show stability (and estimate performance) for a variety of simple control policies.

Additional Details

Thursday, 14 December 2000
4:10 p.m. in Math 109
Coffee/treats at 3:30 p.m. Math 104 (Lounge)

This document is currently not available here.

Share

COinS