1

Operations Scheduling
Faculty : Intro
MANAGEMENT CONSULTANCY
PURPOSE: SOCIAL SERVICE | AREA: PROBLEM SOLVING
MEDIUM: COACHING | EDUCATING | FACILITATING | GUIDING |
LECTURES | MENTORING | TRAINING
BENEFICIARIES: PERSONS | GROUPS | ORGANIZATIONS | COMMUNITIES
PHONE # 91 9987209747 | EMAIL: deeparchan1@gmail.com
WEB PAGE: https://www.facebook.com/DeepArchanConsultancy
FOUNDER: http://in.linkedin.com/pub/sandeep-nemlekar/4/74/72b
-
DEEP-ARCHAN
2
Operations Scheduling
a) One of the planning function of operations management
b) It is most important in Job shop processing
c) Because in Job shop
1) Variety of items is large
2) Machines & workers are versatile
3) So, they perform different type of jobs
d) Examples of Job shop
1) Custom furniture making
2) Specialized equipments manufacturing
3) Restoration & refurbishing works
4) Restaurant serving different dishes on order
5) General Hospital
** **
3
Components of Scheduling
a) Assigning tasks / job orders to different machines (or work centers)
b) Deciding about the sequence of processing of the job on different
machines on the basis of some priority rule (called sequencing or
prioritization)
c) Planning the route of movement of the material from one
department to the other during processing (called routing)
d) Issuing dispatch lists to the various work centers (called dispatching)
Dispatch List is detailed schedule of various orders (work centers,
processing order, processing time, so on)
e) Tracking the progress of various jobs scheduled.
In case of delays in the implementation of schedules, revising the
schedules and expediting the completion of certain jobs (called
expediting)
** **
4
In the absence of proper scheduling
Problems
Delays in meeting the due
dates of customer orders
High work-in-
process inventory
High average
completion time
of jobs
Low utilization of
workers & machines
(high idle time)
No accurate
information available
for the current status
of a job
Higher cost of
production/operations
Higher set-up time
(overall) of machines
5
Forward Scheduling
a) It means assigning customer orders or jobs to various work centers
based on the approach as early as possible.
b) Job is scheduled on a work centre as soon as it is free to process a
job.
c) Job is finished as soon as possible.
d) It is Based on the assumption that a customer is ready to receive the
goods as soon as these are produced.
e) It may result into high WIP if subsequent work centers are busy.
***
6
Backward Scheduling
a) It is a way of scheduling which is based on the approach as late as
possible with the condition that the jobs are finished by their due
dates of delivery to the customer.
b) Planning starts with assigning job to last work centre & according to
the processing time at each centre scheduled is worked out up to
beginning of the processing sequence.
c) The lead times of the earlier processes have to be known accurately.
d) It may result in significant reduction of WIP.
** **
7
Loading
a) Loading means assigning tasks to work centers or machines.
b) Finite Loading means loading of jobs on machines or work centers is
done keeping in view their maximum capacity.
c) Infinite Loading means while assigning tasks to a machine or work
center, its maximum capacity is overlooked.
It is done when the excess work scheduled can be
1) shifted to other work centers or time periods.
2) executed by working overtime or by sub-contracting
This is termed as capacity expansion
** **
8
Different Methods of Sequencing /
Assignment of Jobs on Machines
Scheduling
Sequencing n jobs Sequencing two jobs on n
machines in different machine
sequences (Akers method)
Assigning n jobs
on m machines
First come, first
served (FCFS)
method
Last come,
first served
(LCFS)
method
Due date
method
Random
method
Shortest
processing time
(SPT)) method
Assignment
Model
On one
machine
On two
machines
On three
machines
On m
machines
Johnsons
method
In the same job
sequence
9
Sequencing n jobs on one machine-I
Job PT DD
A 3 9
B 7 10
C 4 7
D 2 4
E 5 8
F 8 12
Total
Average
Flow Time
Delay
0+3 = 3 0
3+7 = 10 0
10+4 = 14 7
14+2 = 16 12
16+5 = 21 13
21+8 = 29 17
93 49
15.5 8.167
Flow Time
Delay
0+8 = 8 0
8+5 = 13 5
13+2 = 15 11
15+4 = 19 12
19+7 = 26 16
26+3 = 29 20
110 64
18.33 10.67
Job PT DD
F 8 12
E 5 8
D 2 4
C 4 7
B 7 10
A 3 9
Total
Average
First Come First Served (FCFS) Last Come First Served (LCFS)
Example Order of arrival of jobs A to F,
PT = Processing time (days),
DD = due date (days from start)
10
Sequencing n jobs on one machine-II
Job PT DD
D 2 4
C 4 7
E 5 8
A 3 9
B 7 10
F 8 12
Total
Average
Flow Time
Delay
0+2 = 2 0
2+4 = 6 0
6+5 = 11 3
11+3 = 14 5
14+7 = 21 11
21+8 = 29 17
83 36
13.833 6
Flow Time
Delay
0+7 = 7 0
7+8 = 15 3
15+2 = 17 13
17+3 = 20 11
20+4 = 24 17
24+5 = 29 21
112 64
18.67 10.833
Job PT DD
B 7 10
F 8 12
D 2 4
A 3 9
C 4 7
E 5 8
Total
Average
Due Date Method Random Method
Example Order of arrival of jobs A to F,
PT = Processing time (days),
DD = due date (days from start)
11
Sequencing n jobs on 2 machines
Gantt Chart
Jobs M1 M2
J1 3 7
J2 5 9
Example processing required in the order M1, M2
& processing times are as given in the table.
Find the sequence of jobs to minimize total processing
time.
Solution
Now, Gantt Chart starting with J1 on M1
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
M1 J1 J2
M2 Idle J1 J2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
M
1
J2 J1
M
2
Idle J2 J1
Now starting with J2 on M1
So, the sequence J1, J2 minimizes total processing time
12
Johnson Method: Sequencing n jobs on 2 machines-I
Job M1 M2
A 2 7
B 5 3
C 1 4
D 6 7
E 2 8
F 3 9
G 5 10
H 1 2
I 6 1
J 8 5
Optimal Sequences
1. H C A E F G D J B I
2. C H A E F G D J B I
3. H C E A F G D J B I
4. C H E A F G D J B I
Solution:
Sequence starts with smallest
processing time at M1
It ends with smallest processing
time at M2.
Accordingly positions of jobs in
the sequence are given in the
adjacent table
Position in Sequence from
Start End
1 or 2
2 or 1
1
3 or 4
4 or 3
5
2
6
3
7
Example:
10 jobs to be processed on 2 machines in the order M1, M2. For each
job processing time in hrs is given in the table. Find overall processing
time, waiting time of the jobs & idle times of the machine.
13
Sequencing n jobs on 2 machines-II
Each optimal sequence will have same overall processing time for 10
jobs. So,
Optimal
Sequence I
Job M1 M2
H 1 2
C 1 4
A 2 7
E 2 8
F 3 9
G 5 10
D 6 7
J 8 5
B 5 3
I 6 1
M1
in out
0 1
1 2
2 4
4 6
6 9
9 14
14 20
20 28
28 33
33 39
M2
in out
1 3
3 7
7 14
14 22
22 31
31 41
41 48
48 53
53 56
56 57
Waiting
Time
0
1
3
8
13
17
21
20
20
17
Idle time of machine
M1 57 39 = 18
M2 1 0 = 1
Processing time = 57