This project looked at a simple queuing system with three different due date distributions. For each task generated, a deadline was assigned. The server then served the most urgent task first, for a time-step, then reassessed the most urgent, and continued until all tasks were served. We have numerically simulated the due dates with the exponential, random, and triangular distributions. generated lead time profiles, and have compared the data with theoretical predictions to determine the accuracy of our method.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Morgan, Brittany Rose.

Publisher

• Worcester Polytechnic Institute

Identifier

• 03D192M

Advisor

• Doytchinov, Bogdan D.

Year

• 2003

Date created

• 2003-01-01

Resource type

• Major Qualifying Project

Major

• Mathematical Sciences

Rights statement

• In Copyright