Scheduling and controlling production

activities

Presented by,
Divya B J
1I sem Mtech
Master in engineering management
Bahubali college of engineering

1
Content

 Introduction to scheduling
 Objectives in scheduling
 Types of scheduling
 Scheduling methodology
 Production activity control
 Performance measures
 Single machine scheduling
 SPT rule
 EDD rule
 conclusion

2
Introduction to Scheduling

Scheduling can be defined as “prescribing of

when and where each operation necessary to
manufacture the product is to be performed.” It
is also defined as “establishing of times at which
to begin and complete each event or operation
comprising a procedure”.

3
Objectives in scheduling

 Meet customer due dates

 Minimize job lateness
 Minimize response time
 Minimize completion time
 Minimize overtime
 Minimize idle time
 Minimize work in progress inventory

4
Types of Scheduling

 Forward scheduling
- Start when the order is received
- May finish early
- Used to determine the earliest completion date
- Determine promise dates
- Build inventory

5
Backward scheduling
- Uses MRP logic
- Schedule last operation to be complete on the
due date
- Reduces inventory

6
Scheduling methodology

 Gantt Charts and boards

 Priority decision rules, and
 Mathematical programming methods

7
Gantt Charts and boards

Gantt charts and associated scheduling boards

have been extensively used scheduling devices in
the past, although many of the charts are now
drawn by computer.
1. Scheduling or progress charts
2. Load charts
3. Record a chart,

8
Priority decision rules

Symbol Priority rule

FCFS First come, first served
EDO Earliest due date
LS Least slack
SPT Shortest processing time
LPT Longest processing time
PCO Preferred customer order
RS Random selection

9
Mathematical programming methods

 Linear programming model

 PERT/CPM network model

10
Production activity control

 Release work orders to the shop for

manufacturing
 Control work orders to complete on time
 Control detailed the flow of orders
 Manage day-to-day activity and provide support

11
Loading – assignment of jobs to process centers

Finite loading – consider capacity

Infinite loading – unlimited capacity, like MRP

12
Performance measures

 Flow time of a job: duration of time from a job

enters into the system until it leaves
 Lateness of a job: amount by which
completion time exceeds due date
 Tardiness = max lateness,0
 make span

13
Single machine scheduling

There is one machine on which several jobs

have to be processed
The order in which these jobs will be processed
needs to be specified. This schedule will not be
changed until all jobs have been processed.

14
SPT rule
The following measures are equivalent
 Mean flow time
 Mean waiting time
 Mean lateness
 SPT minimizes mean flow time, mean waiting
time, and mean lateness for single machine
sequencing

15
Earliest-due-date scheduling

If the objectives is to minimize the maximum

lateness, then the jobs should be sequenced
according to their due dates.

16
Weighted shortest processing time

The weighted shortest processing time rule is a

variation of the SPT rule. let t[i] and w[i] denote
the processing time and the weight associated
with the job to be done in the sequence ordered
by the WPST rule.

17
Conclusion
Scheduling is the allocation of resources over a
period of time to accomplish a specific set of
tasks.
It helps in the achievement of the goals that
have been set by the company.

18
Reference

 www.google.com
 www.wikipedia.com
 Operation management books by Adam &
Ebert

19
THANK YOU

20