{"id":1120,"date":"2020-06-17T07:13:40","date_gmt":"2020-06-17T07:13:40","guid":{"rendered":"https:\/\/people.utm.my\/nurarina\/?page_id=1120"},"modified":"2020-06-22T10:24:10","modified_gmt":"2020-06-22T10:24:10","slug":"weekly-schedule-lesson-plan","status":"publish","type":"page","link":"https:\/\/people.utm.my\/nurarina\/weekly-schedule-lesson-plan\/","title":{"rendered":"Weekly Schedule SSCM4823 [Scheduling]"},"content":{"rendered":"

[vc_row][vc_column][vc_column_text]<\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

\nWeek 1\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Introduction to Scheduling. Definition (scheduler model and objectives), scheduling applications, the role of scheduling<\/td>\n<\/tr>\n

\nWeek 2\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Framework and notations (machine environment, task characteristic, performance measure).<\/td>\n<\/tr>\n

\nWeek 3\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Methodology, three-field notations, assumptions, Gantt Chart, solves small cases.<\/td>\n<\/tr>\n

\nWeek 4<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Single Machine Scheduling. Definition, SPT rule for minimizing total completion time, WSPT rule for minimizing total weighted completion time, algorithm for chain problem.<\/td>\n<\/tr>\n

\nWeek 5<\/em><\/span><\/strong><\/td>\n<\/tr>\n
WDSPT for minimizing total weighted discounted completion time, algorithm for out-tree and in-tree problem.<\/td>\n<\/tr>\n

\nWeek 6\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Algorithms for problem with due-date objective functions (lateness, number of tardy jobs, the total tardiness).<\/td>\n<\/tr>\n

\nWeek 7<\/span><\/strong><\/em><\/td>\n<\/tr>\n
Parallel Machines Scheduling. Types of parallel machines, assumptions, comparisons, problem statement for identical parallel machines, LPT for minimizing makespan without preemtion, worst case example of LPT.<\/td>\n<\/tr>\n

\nWeek 8<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Precedence constraint with unlimited number of machine in parallel (determine the critical job, critical path, slack job and slack time). CP rule and LNS rule for unit processing time and tree constraint, worst case of CP rule, generalized CP rule, generalised LNS rule.<\/td>\n<\/tr>\n

\nWeek 9\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
LP for preemtion problem, algorithm for minimizing makespan with preemtions for continuous time, LRPT rule for minimizing makespan with preemtion in descrete time.<\/td>\n<\/tr>\n

\nWeek 10\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Uniform parallel machine. Definition, lower bound for uniform machine with preemtion in minimizing makespan, LRPT-RM rule.<\/td>\n<\/tr>\n

\nWeek 11\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Unrelated parallel machine. Definition, MILP formulation for unrelated parallel machine in minimizing total completion time, MILP formulation for unrelated parallel machine in minimizing makespan with preemtion.<\/td>\n<\/tr>\n

\nWeek 12<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Job Shop Scheduling. Definition, Disjunctive programming: disjunctive graph, disjunctive programming formulation<\/td>\n<\/tr>\n

\nWeek 13\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Active schedule algorithm: definition, initial directed graph, machine selection, branching step, branching tree, Gantt chart.<\/td>\n<\/tr>\n

\nWeek 14\u00a0<\/em><\/span><\/strong><\/td>\n<\/tr>\n
Revision week before final exam.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n","protected":false},"excerpt":{"rendered":"

[vc_row][vc_column][vc_column_text] Week 1\u00a0 Introduction to Scheduling. Definition (scheduler model and objectives), scheduling applications, the role of scheduling Week 2\u00a0 Framework and notations (machine environment, task characteristic, performance measure). Week 3\u00a0 Methodology, three-field notations, assumptions, Gantt Chart, solves small cases. Week 4 Single Machine Scheduling. Definition, SPT rule for minimizing total completion time, WSPT rule for […]<\/p>\n","protected":false},"author":15797,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-1120","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/pages\/1120","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/users\/15797"}],"replies":[{"embeddable":true,"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/comments?post=1120"}],"version-history":[{"count":8,"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/pages\/1120\/revisions"}],"predecessor-version":[{"id":1229,"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/pages\/1120\/revisions\/1229"}],"wp:attachment":[{"href":"https:\/\/people.utm.my\/nurarina\/wp-json\/wp\/v2\/media?parent=1120"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}