Syllabus
|
Course Code: Elective-IV . MTIP-112 Course Name: Sequencing and Scheduling |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Single-Machine Sequencing: Introduction, Preliminaries, Problems without Due Dates, Problems with Due Dates Optimization Methods for the Single-Machine Problem: Introduction, Adjacent Pairwise Interchange Methods, A Dynamic Programming Approach, Dominance Properties, A Branch and Bound Approach. Earliness and Tardiness Costs: Introduction, Minimizing Deviations from a Common Due Date, The Restricted Version, Asymmetric Earliness and Tardiness Costs, Quadratic Costs, Job-Dependent Costs, Distinct Due Dates, Sequencing for Stochastic Scheduling. |
|
| 2 | Extensions of the Basic Model: Introduction, Non-simultaneous Arrivals, Related Jobs, Sequence-Dependent Setup
Times, Stochastic Models with Sequence-Dependent Setup Times. Parallel machine models: Introduction, Minimizing the Makespan, Minimizing Total Flow time, Stochastic Models |
|
| 3 | Flow Shop Scheduling: Introduction, Permutation Schedules, The Two-Machine Problem, Special Cases of The ThreeMachine Problem, Minimizing the Makespan, Variations of the m-Machine Model, Stochastic flow shop scheduling. | |
| 4 | The Job Shop Problem: Introduction, Types of Schedules, Schedule Generation, The Shifting Bottleneck Procedure,
Neighborhood Search Heuristics. Simulation Models for the Dynamic Job Shop: Introduction, Model Elements, Types of Dispatching Rules, Reducing Mean Flowtime, Meeting Due Dates. |
|
