SIT316 - Optimisation and Constraint Programming

Year:

2020 unit information

Enrolment modes: Trimester 2: Burwood (Melbourne), Cloud (online)
Credit point(s): 1
EFTSL value: 0.125
Prerequisite:

SIT192 and SIT215

Corequisite:

Nil

Incompatible with:

Nil

Study commitment

Students will on average spend 150 hours over the teaching period undertaking the teaching, learning and assessment activities for this unit.

Scheduled learning activities - campus

1 x 3 hour seminar per week.

Scheduled learning activities - cloud (online)

2 x 1 hour scheduled online workshop per week.

Content

This unit explores the commonly used computational skills for real-life optimization, planning, and decision making problems, such as routing, scheduling, machinery workflow, network design, logistics, staff rostering, resource allocation, and supply chain optimization with applications in industries including airline, mining, healthcare, science, education, wholesale and retail, as well as other government, and civic services.

Students will learn the concepts of combinatorial optimisation and constraint satisfaction by studying a number of classic problems, concepts of modelling, practical considerations, algorithms and packages, decision support and expert systems.

Hurdle requirement

To be eligible to obtain a pass in this unit, students must meet certain milestones as part of the portfolio, and must achieve a passing grade in the examination.

Talk to a Deakin adviser about studying at Deakin today

Call 1800 693 888Monday to Friday: 9am to 5pm AEDT
Chat live nowMonday to Friday: 8am to 7pm AEDT