Sunteți pe pagina 1din 11

IE

503 – Operations Analysis


Instructor - Narayan Rangaraj – IEOR, IIT Bombay
narayan.rangaraj@iitb.ac.in
TAs – many
Super TA: Tejas Ghorpade trghorpade@iitb.ac.in
Lectures – Wed 1105-1230, Fri 1105-1230
Room – LH 101 (Lecture Hall Complex)
Topics
• Location models [for plants, warehouses and other facilities]
• Layout models [for manufacturing facilities]
• Capacity planning
• Aggregate production planning [including MRP – Material
Requirements Planning]
• Principles of Just-in-Time systems
• Inventory models
– Deterministic [EOQ and Lot Sizing]
– Stochastic [Newsvendor, (R,Q) and(s,S) models]
• Scheduling
– Single machine sequencing
– Assembly line balancing
– Project planning
After this course ...
After doing this course, you should have
• A basic idea of the major decision areas in
managing a modern manufacturing facility
• Some of the main models in IE and OR that
are relevant to such decisions
• Some mathematical and computational
principles behind these models
• An idea of when and where to apply these
models
Specifically, familiarity with
• Location and layout models
• Principles of materials requirement planning
and EOQ models
• Newsvendor model
• Basic scheduling theory applied to single
machine/resources and simple extensions
• An exposure to principles of modern
manufacturing like Just in Time, Quality etc.
Typical practical problem in Operations
Analysis
• A pharma plant has a production line with many
machines {1,2,3, …, m} – dryers, mixers, reactors etc.
– Why is the line defined this way?
• It makes many products {1,2, …, n} on the line
– Why many products on one line (why not one line per
product)? Why only these products?
• One ton of each product consumes some amount of
resource on each machine – this is given
• In a year, how much of each product should we make
on the line?
– When should we do it? Sequence and how often?
Evaluation
• One end semester – 50 percent – Closed book
• Mid sem – 25 percent – Closed book
• Two quizzes – 7-8 percent each – Closed book

We plan to use SAFE exam for quizzes – details in next class

All complicated but relevant formulae/expressions will be


provided in question paper – no need for cheat sheet

Any cheating will result in grade penalty and reporting to the Dean AP’s office

No tutorials. Assigned reading, some assignments. TAs and I will be available at some
times for discussion on some topics, to be announced on Friday

TAs will do some grading of questions, but will not answer cribs about evaluation –
that is done only by me
Background material and linkages with
other courses (IEOR students)
• Modeling exercises in lab courses (IE 507)
– Especially use of integer variables in 0-1 constraints

• Optimization models (IE 501)


– Linear Programming
– Network Flow models
– Integer Programming

• Dynamic Programming
– Shortest Path Models
B.Tech/BS/B.Des - DD students
You would have done works visits, internships,
projects etc. in some industry

You have done some courses involving modeling


and data analysis

No course cap on registering for the course – for


general elective, additional learning, institute
elective etc.

Minor will be as per institute rules


Reference material

• Material covered will be at the level of


Production and Operations Analysis –
S.A.Nahmias, Wiley
• There are many books that are equivalent to this
and which cover most of the topics in this course,
e.g. – Chase Aquilano Jacobs – Buffa
• Very good reference books
– Factory Physics by Hopp and Spearman
– Matching Supply with Demand by Cachon and
Terwiesch
Assignment 0 – problem 1

An institute admits
n1 students for a course with duration d1
...,
nk students for a course with duration dk (duration in years).

In steady state, how many hostel rooms does the institute


require?

As a follow up, if the duration of completion is not fixed, but


can be variable (e.g. a random variable with a known
distribution), then how does one plan the accommodation?
Assignment 0 – problem 2
On a (linear) stretch of beach, a vendor intends to set up a stall to sell
food. Customers are uniformly spread over the entire length L of the
beach. Propose different criterion on the basis of which the vendor could
decide the location of the stall.
a) If the vendor wants to minimize total or average distance travelled by
customers where would she locate?
b) Customers accesses stall with probability p inversely proportional to
distance to stall. If we want to set up stall to maximize the expected
number of customers that we will get, where should we put it up?
c) If we can set up two stalls, where should we put them up?
d) If the two vendors are competing, how would they position
themselves? Argue that if one vendor is at location a in the interval [0,L],
what would be the best location for the other vendor, and thereby find
the best location chosen by both vendors.
e) If the two vendors co-operate, then decide where they should set up.

S-ar putea să vă placă și