IE3403 OPERATIONS SCHEDULING SYLLABUS | ANNA UNIVERSITY BE INDUSTRIAL ENGINEERING 7TH SEM SYLLABUS REGULATION 2008 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY SEVENTH SEMESTER BE INDUSTRIAL ENGINEERING DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
IE3403 OPERATIONS SCHEDULING L T P C
3 0 0 3
OBJECTIVE:
To impart knowledge on various scheduling techniques applicable to Job shop, Flow
shop configurations.
50
UNIT I SCHEDULING AND SEQUENCING 6
Scheduling function – Scheduling theory – Sequencing and scheduling objectives –
Constraints – Pure sequencing problem – Ready time – Flow time – Lateness –
Tardiness- In process inventory – SPT, EDD, WSPT – Regular measure of
performance- Sequencing theorems.
UNIT II SINGLE MACHINE MODEL 10
Minimization of number of tardy jobs: Hodgson’s algorithm – Minimizing mean flow
time: Smith’s rule – Minimizing mean tardiness: Wilkerson Irwin algorithm – Dynamic
programming approach – Branch and Bound algorithm – Neighbourhood search
technique – Non simultaneous arrivals – Minimizing mean tardiness for dependent
jobs – Minimizing weighted mean flow time: Horn’s method, Sidney’s algorithm-
Sequence dependent set up times.
UNIT III PARALLEL MACHINE MODEL 8
Independent jobs: McNaughton’s algorithm for makespan minimization– Heuristic
procedures to minimize mean flow time and makespan – Minimizing mean
weighted flow time: H1 heuristic and Hm heuristic– Dependent jobs: Hu’s algorithm
– Muntz Coffman algorithm.
UNIT IV FLOW SHOP MODEL 10
Characteristics – Johnson’s algorithm – Extension of Johnson’s rule – Campbell
Dudek Smith algorithm – Palmer’s heuristic approach – Start lag, Stop lag – Mitten’s
algorithm – Ignall Schrage algorithm - Despatch index heuristic
UNIT V JOB SHOP MODEL 11
Characteristics-Graphical description – Jackson’s method – Feasible, Semi-active
schedules – Active schedule generation – Non delay schedule generation –
Heuristics schedule generation – Priority dispatching rules – simulation – Open shop
scheduling
REFERENCES:
1. Introduction to sequencing and scheduling – Kenneth R.Baker John Wiley &
Sons, New York, 2000.
2. Industrial scheduling – Dilip R.Sule, PWS Publishing company, Boston, 1997.
IE3403 OPERATIONS SCHEDULING L T P C
3 0 0 3
OBJECTIVE:
To impart knowledge on various scheduling techniques applicable to Job shop, Flow
shop configurations.
50
UNIT I SCHEDULING AND SEQUENCING 6
Scheduling function – Scheduling theory – Sequencing and scheduling objectives –
Constraints – Pure sequencing problem – Ready time – Flow time – Lateness –
Tardiness- In process inventory – SPT, EDD, WSPT – Regular measure of
performance- Sequencing theorems.
UNIT II SINGLE MACHINE MODEL 10
Minimization of number of tardy jobs: Hodgson’s algorithm – Minimizing mean flow
time: Smith’s rule – Minimizing mean tardiness: Wilkerson Irwin algorithm – Dynamic
programming approach – Branch and Bound algorithm – Neighbourhood search
technique – Non simultaneous arrivals – Minimizing mean tardiness for dependent
jobs – Minimizing weighted mean flow time: Horn’s method, Sidney’s algorithm-
Sequence dependent set up times.
UNIT III PARALLEL MACHINE MODEL 8
Independent jobs: McNaughton’s algorithm for makespan minimization– Heuristic
procedures to minimize mean flow time and makespan – Minimizing mean
weighted flow time: H1 heuristic and Hm heuristic– Dependent jobs: Hu’s algorithm
– Muntz Coffman algorithm.
UNIT IV FLOW SHOP MODEL 10
Characteristics – Johnson’s algorithm – Extension of Johnson’s rule – Campbell
Dudek Smith algorithm – Palmer’s heuristic approach – Start lag, Stop lag – Mitten’s
algorithm – Ignall Schrage algorithm - Despatch index heuristic
UNIT V JOB SHOP MODEL 11
Characteristics-Graphical description – Jackson’s method – Feasible, Semi-active
schedules – Active schedule generation – Non delay schedule generation –
Heuristics schedule generation – Priority dispatching rules – simulation – Open shop
scheduling
REFERENCES:
1. Introduction to sequencing and scheduling – Kenneth R.Baker John Wiley &
Sons, New York, 2000.
2. Industrial scheduling – Dilip R.Sule, PWS Publishing company, Boston, 1997.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...