1 / 18

MIS Scheduling Project

MIS Scheduling Project. Team MIS Brainiacs Wafa Elgarah Natasha Falaleeva Virginia Ilie EEL5881. High Level Design. High Level Design. High Level Design. Interface Diagram - . High Level Design. Architecture Design - . High Level Design. Design Issues - Maintainability

kiora
Download Presentation

MIS Scheduling Project

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MIS Scheduling Project Team MIS Brainiacs Wafa ElgarahNatasha FalaleevaVirginia Ilie EEL5881

  2. High Level Design

  3. High Level Design

  4. High Level Design • Interface Diagram -

  5. High Level Design • Architecture Design -

  6. High Level Design • Design Issues - • Maintainability • Developers will not be around. • Detailed documentation. • Testability • Developing test scenarios could be a challenge. • May not cover all scenarios

  7. High Level Design • Design Strategies - • Assignment Algorithm • Use solver in Excel • Embed it in VB.net

  8. Detailed Design • Entity Relationship Diagram

  9. Detailed Design No.1 -  Faculty Form - Statement: The system shall allow the user to add/modify and delete Faculty members Source: Customer Dependency: Successful connection to the DB Conflicts: None Supporting Materials: Customer requirements Evaluation Method: Test Case 1 and 2 Revision History: 1.1_NF • Trace of Requirement to Design 

  10. Detailed Design No.4 - Class Form - Statement: The system shall allow to specify all the classes to be offered from the general list of classes Source: Customer Dependency: Successful connection to the file that contains all possible classes Conflicts: None Supporting Materials: Customer requirements Evaluation Method: Test Case 1 and 3 Revision History: 1.1_NF • Trace of Requirement to Design  

  11. Detailed Design • Validity checks on inputs and constraints: • All Faculty members must be qualified to teach at least one course. • Instructors cannot teach more than 5 classes and/or sections in one semester.

  12. Detailed Design • Validity checks on inputs and constraints: • Class enrollment will be based on previous semesters. • New_enrol = Old_enrol *(1+r) Where r = predicted growth rate. r is a percentage therefore must be less than 1. • Section total enrollment can not be greater than the classroom capacity - embedded in VB code .

  13. Detailed Design • Scheduling Algorithm • Step 1. Select among time slots not yet considered, slot t with the smallest supply/demand ratio • Step 2. Rank classes in decreasing order of class size. Go in a single pass through the list of classes and assign class j to still vacant room Mj with lowest cost

  14. Detailed Design • Scheduling Algorithm • Step 3. Rank all classes in decreasing order of current cost. Go in a single pass through the list of classes and do the following: • If Class j is not assigned, find all feasible interchanges in which class j moves into an occupied room, displacing the assigned class k into a vacant room • If this set is not empty, make the interchange with maximum cost reduction • If class j is assigned, find the set of feasible assignment exchanges for the class j that reduce total cost • If this set is not empty, make the exchange with maximum cost reduction

  15. Detailed Design • Scheduling Algorithm • Step 4. If step 3 results in a reduction of total cost, return to step 3; otherwise go to Step 5 • Step 5. Delete from the unscheduled list all classes scheduled during current time slot. If not all time slots have been considered go to step 1, otherwise STOP

  16. Questions • Thank You for your Attention!

More Related