Production Planning and

control in Job shop

Planning and control or Job Shop
Production
Job shops handle a variety of job, where
each job is different
n job shop , job & demand both are
unpredictable
Job shop handles the unique jobs each time
with unique set of operations and processing
time
Job machines are general purpose machines
organized department wise
Production Planning and Control
Introduction
oordination of materials with suppliers
Efficient utilization of people and machines
Efficient flow of materials
ommunication with customers
Production Planning and Control
Introduction

A Typical ManuIacturing Systems



SUPPLIERS CUSTOMERS

Raw Materials Finished Products
Materials
Machines
People
Problems o Job Production
%he basic question here is that of scheduling.
When there are 3Jobs awaiting processing
on 2 machines , each job having a pre-
decided sequence of operations and
processing timings, then what should be the
order of loading the jobs on machines so as
to optimize the expected performance
standard ?
pected perormance standards could be:
ean flow time
%otal processing time
dle time of machines
ean earliness and lateness of job
ean tardiness of Job
Number of tardy jobs
ean waiting time
ean number of jobs in the system
%he lactors aecting the solution are:
%otal number of jobs for scheduling
%otal number of machines
anufacturing facilities flow shop or job
shop
Nature of job arrivals static or dynamic
Evaluation criteria for scheduling
f 3 number of jobs) goes up 2 number of
machines) also goes , the problem of
scheduling to that extent becomes more
complex . Here there are no optimal solutions
then .
We then adopt simulation and
heuristic algorithms
Job , One Machine Situation
$everal jobs are to be processed on a single
machine or facility
Prioritization or assignment is necessary
%he objectives are to optimize %, average
WP, average waiting time , tardiness and
total processing time of jobs
%he ollowing terms are employed:
n = number of job
%
i
=Processing time of any job i
W
i
= Waiting time

i
= low time

i
= ompletion time
D
i
= Due delivery date
L
i
= Lateness
%
i
= %ardiness
N
t
= Number of tardy jobs
SP% ~ Shortest Processing %ime
Jobs are arranged in such a way that one
which takes the least time is taken up first,
followed by one with the next smallest
possible time. t achieves following aims at a
time
ean lateness minimized
ean waiting time minimized
ean flow time minimized
ean number of tasks in WP minimized
jobs, %wo Machines situation
N jobs are to be processed on two machines,
and later on the processing times of all
jobs on both the machines are known the
minimum time to complete all jobs require a
particular sequencing Johnson's algorithm is
useful here:
Job down processing time of all jobs on &

ssess the minimum processing time

f the minimum processing time is on ,
position the corresponding job first as early
as possible in sequence if it is on ,
position the corresponding job last as late
as possible in the sequence
Sequencing Rules or job shop
irst-come, first-served $) order they entered the
shop
$hortest Operating %ime $O%) Iongest job done Iast
Earliest Due Date DDate) job with Iast due date goes Iast
$lack %ime Remaining $%R) Time due - current time
$lack %ime per Operation $%R/Op) SIack time divided
by # steps Ieft to do
ritical Ratio R)
processing time / time untiI due, smaIIest ratio goes first
L$ last come, first served - top of the piIe, emaiI
Random order or whim what you feeI Iike
Costs and Benefits of PPC Systems
PP requires a large no. of indirect people
ompanies with ineffective PP system will
have poor customer service, excessive
inventories, low equipment and people
utilization, high rate of part obsolescence,
large number of expediters
Problem
or the Beef Eater Restaurant, management must
decide how to direct different types of customers
into different waitress service areas. anagement
knows that various combinations of customer types
and waitress skills and personalities. Let's use the
assignment algorithm to determine a satisfactory
load assignment. %o begin, we create a matrix of
costs. Rows correspond to customer types jobs)
and columns to waitress work centers).
Customer Type
Waitress
Sally Wanda Bertha
1 12.90 11.90 12.10
2 15.30 15.50 14.30
3 13.90 13.90 13.00
Customer
Type
Waitress Customer
Type
Waitress
Sally Wanda Bertha Sally Wanda Bertha
1 0 0 0 1 0 0 0
2 2.40 3.60 2.20 2 0.20 1.40 0
3 1.00 2.00 0.90 3 0.10 1.10 0
Customer
Type
Waitress
Sally Wanda Bertha
1 0 0 0
2 0.20 1.40 0
3 0.10 1.10 0
Customer
Type
Waitress
Sally Wanda Bertha
1 0 0 0.10
2 0.10 1.30 0
3 0 1.00 0
Customer
Type
Waitress
Sally Wanda Bertha
1 0 0 0.10
2 0.10 1.30 0
3 0 1.00 0
Customer
Type
Waitress Cost
1 Sally 11.90
2 Wanda 14.30
3 Bertha 13.90