1

MIS MIS Scheduling Scheduling

ProjectProject

Team MIS BrainiacsTeam MIS Brainiacs

Wafa ElgarahWafa ElgarahNatasha FalaleevaNatasha Falaleeva

Virginia IlieVirginia Ilie

EEL5881EEL5881

2

High Level DesignHigh Level Design

3

High Level DesignHigh Level Design

4

High Level DesignHigh Level Design

Interface Diagram - Interface Diagram -

5

High Level DesignHigh Level Design

Architecture Design - Architecture Design -

6

High Level DesignHigh Level Design

Design Issues - 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 DesignHigh Level Design

Design Strategies - Design Strategies - Assignment Algorithm Use solver in Excel Embed it in VB.net

8

Detailed DesignDetailed Design Entity Relationship DiagramEntity Relationship Diagram

9

Detailed DesignDetailed Design Trace of Requirement to Trace of Requirement to

Design 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

10

11

Detailed DesignDetailed Design Trace of Requirement to Trace of Requirement to

Design  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

12

13

Detailed DesignDetailed Design Validity checks on inputs and Validity checks on inputs and

constraints:constraints:

All Faculty members All Faculty members must be must be qualifiedqualified to teach at least one course. to teach at least one course.

Instructors Instructors cannot teach more than 5cannot teach more than 5 classes and/or sections in one classes and/or sections in one semester.semester.

14

Detailed DesignDetailed Design Validity checks on inputs and Validity checks on inputs and

constraints:constraints: Class enrollment will be based on Class enrollment will be based on

previous semesters. previous semesters. • New_enrol = Old_enrol *(1+r)New_enrol = Old_enrol *(1+r)

Where r = predicted growth rate. r is a Where r = predicted growth rate. r is a percentage therefore percentage therefore must be less than must be less than 1.1.

Section total enrollment Section total enrollment can not be can not be greater thangreater than the classroom capacity the classroom capacity - embedded in VB code .- embedded in VB code .

15

Detailed DesignDetailed Design Scheduling AlgorithmScheduling Algorithm

Step 1. Select among time slots Step 1. Select among time slots not yet considered, slot t with the not yet considered, slot t with the smallest supply/demand ratiosmallest supply/demand ratio

Step 2. Rank classes in decreasing Step 2. Rank classes in decreasing order of class size. Go in a single order of class size. Go in a single pass through the list of classes pass through the list of classes and assign class j to still vacant and assign class j to still vacant room Mroom Mjj with lowest cost with lowest cost

16

Detailed DesignDetailed Design Scheduling AlgorithmScheduling Algorithm

Step 3. Rank all classes in decreasing order Step 3. Rank all classes in decreasing order of current cost. Go in a single pass through of current cost. Go in a single pass through the list of classes and do the following:the list of classes and do the following:• If Class j is not assigned, find all feasible If Class j is not assigned, find all feasible

interchanges in which class j moves into an interchanges in which class j moves into an occupied room, displacing the assigned occupied room, displacing the assigned class k into a vacant roomclass k into a vacant room

• If this set is not empty, make the If this set is not empty, make the interchange with maximum cost reductioninterchange with maximum cost reduction

• If class j is assigned, find the set of If class j is assigned, find the set of feasible assignment exchanges for the feasible assignment exchanges for the class j that reduce total costclass j that reduce total cost

• If this set is not empty, make the exchange If this set is not empty, make the exchange with maximum cost reductionwith maximum cost reduction

17

Detailed DesignDetailed Design Scheduling AlgorithmScheduling Algorithm

Step 4. If step 3 results in a Step 4. If step 3 results in a reduction of total cost, return to reduction of total cost, return to step 3; otherwise go to Step 5step 3; otherwise go to Step 5

Step 5. Delete from the Step 5. Delete from the unscheduled list all classes unscheduled list all classes scheduled during current time scheduled during current time slot. If not all time slots have slot. If not all time slots have been considered go to step 1, been considered go to step 1, otherwise STOPotherwise STOP

18

QuestionsQuestions

Thank You for your Attention!Thank You for your Attention!