Vous êtes sur la page 1sur 14

Presentation On

Job Shop Scheduling &


Dispatching
Rules
MODELLING & ANALYSIS OF
MANUFACTURING SYSTEM
Submitted by,

Nithin Narayanan
M. Tech MMS
College of Enginneering Thalassery
1

JOB SHOP SCHEDULING


JOB SHOP PROBLEM

Assign N jobs on M machine


For each job we have
Sequence of machines
required
Processing time on eachObjectives
Make span of all jobs
machine
MINIMIZE Number of tardy
Due dates
jobs

Average tardiness
Average flow time
2

DISPATCHING
RULES
Static Rules
LTWK, EDD
DISPATCHING
RULES

Dynamic Rules
LWKR, Slack based
rules

Slack = Due date Current time Remaining work time.

STANDARD DISPATCHING RULES


Name

Description

SPT
EDD

Shortest processing time

Select a job with minimum processing time

Earliest Due Date

Select a job due first

FCFS

First Come First Served

Select a job has been the workstations queue


the longest

FISFS

First In System First Served

Select job that has been on the shop floor the


longest

S/RO

Slack per Remaining


Operation

Select a job with smallest ratio of slack to


operations remaining

Covert

Order jobs based on ratio of slack based priority to processing time

LTWK
LWKR

Least Total Work

Select a job with smallest total processing time

Least Work Remaining

Select a job with smallest total processing time


for
unfinished operations

MOPNR

Most Operations Remaining

Select a job with most operations remaining in


its processing sequence

MWKR

Most Work Remaining

Select a job with the most total processing time


remaining

RANDOM Select a job at random using random table


WINQ

Work In Next Queue

Select a job with whose subsequent machine


has the shortest queue

EXAMPLE
Job

Current

J1
J2
J3
time
J4

Arrival Arrival
to
at B
syste
m

10
0
is 010.
0

10
5
9
8

Due
date

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

Machine B has just finished a job, and it is time to select


its next job.
For each of the dispatching rules,
SPT (Shortest
processing time):
corresponding
sequence.

determine

the

On machine B,

Processing time (J1, J2, J3, J4) = (5, 3, 2, 4)


Arranging shortest processing time first
{J3, J2, J4, J1}

EXAMPLE
Job

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

10
0
0
0

10
5
9
8

Due
date

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

EDD (Earliest Due Date)


Due dates for Jobs (J1, J2, J3, J4) = (30, 20,
10, 25)
Arranging least due date first,
{J3, J2, J4, J1}
6

EXAMPLE
Job

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

Due
date

Operation (machine,
pij)
1
2
3

10
10
30
(B,5)
(A,1)
0
5
20
(A,5)
(B,3)
0
9
10
(C,3)
(D,2)
25First
(E,6)
(B,4)
FCFS0 (First8 Come
Served)

(D,6)
(C,2)
(B,2)
(C,4)

Jobs (J1, J2, J3, J4) arrived at B at times (10, 5, 9, 8)


Arranging increasing arrival order
{J2, J4, J3, J1}
FISFS (First In System First Served)
Jobs (J1, J2, J3, J4) have arrived at system at times
(10, 0, 0, 0)
J1 goes last, by arbitrarily choosing {J2, J3, J4, J1}7

EXAMPLE
Job

J1
J2
J3
J4

Covert:
1
Delay cost
1

Arrival Arrival
to
at B
syste
m

10
0
0
0
if slack < 0

10
5
9
8

Due
date

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

if slack > E (Waiting time )


Otherwise

For jobs (J1, J2, J3, J4) remaining work (time) are (3, 2, 1, 2)
Assume 0.5 times waiting time (E) (1.5, 1, 0.5, 1)
For jobs J1, J2, J4 slack > E, therefor delay cost = 0
For jobs J3 slack < 0, therefor delay cost is 1
So the delay cost of jobs for 0.5 (J1, J2, J3, J4) are (0, 0, 1, 0)
J3 goes first, then chose arbitrarily, sequence is {J3, J2, J4, J1}

Slack
J1 = 30 10 5 1 6 = 8
J2 = 20 10 3 2 = 5
J3 = 10 10 2 = 2
J4 = 25 10 4 4 = 7
8

EXAMPLE
Job

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

10
0
0
0

10
5
9
8

Due
date

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

LTWK (Least Total Work)


Total work values are
J1 = 5 + 1 + 6 = 12
J2 = 5 + 3 +2 = 10
J3 = 3 + 2 + 2 = 7
J4 = 6 + 4 + 4 = 14
Arranging least work first, sequence is {J3, J2, J1, J4}
9

EXAMPLE
Job

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

10
0
0
0

10
5
9
8

Due
date

LWKR (Least Work Remaining)

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

Remaining time for remaining works


J1 = 5 + 1 + 6 = 12
J2 = 3 +2 = 5
J3 = 2 = 2
J4 = 4 + 4 = 8
Arranging in least work remaining order, sequence is {J3, J2, J4, J1}
10

EXAMPLE
Job

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

10
0
0
0

10
5
9
8

Due
date

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

MOPNR (Most Operations Remaining)


Number of remaining operations for jobs (J1, J2, J3, J4) are (3, 2, 1, 2)
Arranging most operations remaining first, sequence is {J1, J2, J4, J3}

11

EXAMPLE
Job

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

10
0
0
0

10
5
9
8

Due
date

30
20
10
25

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

MWKR (Most Work Remaining)


Reverse the order of LWKR Sequence is {J4, J1, J2, J3}

12

EXAMPLE
Job

RANDOM:

J1
J2
J3
J4

Arrival Arrival
to
at B
syste
m

10
0
0
0

10
5
9
8

Due
date

30
20
10
25

Using random table, sequence is {J3, J2, J4, J1}

Operation (machine,
pij)
1
2
3

(B,5)
(A,5)
(C,3)
(E,6)

(A,1)
(B,3)
(D,2)
(B,4)

(D,6)
(C,2)
(B,2)
(C,4)

WINQ (Work In Next Queue)


Requires length of queue at machines A and C
Job J3 goes first - It has no next queue.
Jobs J2 and J4 comes next - They are headed for machine C, which has less work in its queue than A.
Sequence is {J3, J2, J4, J1}
13

Conclusion
Job shop scheduling is assigning a number of jobs on number of
machines in an optimum way.
Dispatching rules
The selection of rules are based on the nature of the work.
The optimum way of dispatching is shown with the help of a simple
problem.
Reference
Modelling and Analysis of Manufacturing Systems - Ronald G Askin (The
University of Arizona) & Charles R Standridge (Florida A & M University/ Florida
State University College of Engineering)
14

Vous aimerez peut-être aussi