Doytchinov, Bogdan D.
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.
Worcester Polytechnic Institute
Major Qualifying Project
Access to this report is limited to members of the WPI community. Please contact a project advisor or their department to request access
Restricted-WPI community only