Operations Scheduling

Introduction:

Operation Management requires planning and control at various

levels and time horizons. In aggregate planning, it required for
planning with the medium term.

In this scheduling chapter, I will focus planning and control in

short term.
Short term denoted a time horizon close to real time.
Manufacturing and service organization,
a horizon ranging from a day to at most a week or two.

In short term focus on micro-resources, a single machine, a set of

workers and so on.
In short term planning and scheduling, the strategic importance of
scheduler is:

How can jobs be assigned to various work centers?

How can the jobs be ranked-ordered?

How can resources such as skilled workers be assigned to

the operations system?

How can performance of the operating system be measured?

To addressed the issue we need for Operations Scheduling.

What is Scheduling?

Allocation of limited resources to jobs over time.

Assignment of each operation of each job a start and a
completion time onto a time scale of a machine with the
precedence relations

Questions on Scheduling

What is a good (optimal) schedule?

Is it easy or difficult to obtain a good schedule?
Is it worthwhile to invest time and money to obtain a good
schedule rather than to take a simple one?
Why is it so difficult to obtain a good schedule in real world
problems?
Why are Scheduling Problems so difficult?
Very hard to quantify various performance measures
Multiple objectives are conflicting among them.
Too complicated to construct mathematical models
Heavy computational requirements (IP Model, NP-Hard)

Major Approaches for Scheduling Problems

Mathematical Approaches (Exact, Approximated)
Meta Heuristics Approaches
Tabu Search
Simulated Annealing
Genetic Algorithm
Constraint Satisfaction
Neural Network
Hybrid Approaches
Operations scheduling uses a defined framework to address issues
associated with the use of availability resources and the delivery of
products and services as promised to the customers.

Planning related term:

Loading utilization of resources in the best possible way.

Scheduling is defined as the process of rank-ordering the jobs in front

of each resource to maximization of some performance measure.

If there are n jobs waiting in front of machine, using scheduling, the

planner will rank order them for processing. The objective of ordering
to minimize the waiting time, cost for all jobs.
Classification of scheduling:
Static Shops: Assumed that all the jobs are available at the
beginning of the scheduling time period (t=0). Example: Auto
repair shop starts at 9.00am, the owner finds orders are collected
for the day and will delivered in that day.

Dynamic Shops: Jobs can arrive later and exact arrival times are
not known. All jobs are not available at time (t=0).
Example: Railway reservation center customers arrive throughout
its service hours.
Deterministic versus Stochastic scheduling
The job characteristics such as ready time, processing time and
due date are all known with certainty.
In stochastic scheduling, the job characteristics are uncertain.
Parameters are assumed from historical observation.
Service times assumed to be uncertain.
The scheduling problem are classified as:

Single machine problem: Assume that only one machine exists

and the problem is to sequence the jobs on that machine. In the
parallel machine, more than one machine is exits and a job can be
processes entirely on any one of the machine.

Flow shops: All the jobs visit all the machines in the same order.
Assumed that machines are numbered according to the sequence
of visit of the jobs.

Job shop: Each job has a unique route.

Open shops: Assume that any operation can be carried out on any
machine.
Flow shop: In flow shop , the resources are organize one after the
other in order the job processed.

Machine 1 Machine 2 Machine 3

Pressing Cutting Welding

In pure flow shop the jobs are visit all the machines in the same order
(begin machine 1 and end machine m). The n jobs will for form
in n! ways.
each job must be processed by each machine exactly once
all jobs have the same routing.
a job cannot begin processing on the second machine until it has
completed processing on the first.
Job Shop: The machines are not organized in processing order. Each
job follow a unique order in which it visits the machines for processing.
There is no requirement for all jobs to visit a particular machine for the
first operation or a particular machine for their last operation.
each job may have a unique routing
Machine
2
Job 1
Machine
5
Machine
Machine Job 2
1
4

Job 3
Machine
Machine 6
3
 Assumption in Scheduling
All the jobs are available at time zero (static scheduling).

The machines are available throughout the scheduling period.

The processing time are known and deterministic

A machine can process only one job at a time.

A job once taken up is completed fully before the next job is taken.

An operator of a job is done on only one machine.

No job interruption.
 Objectives in Scheduling

Meet customer due dates

Minimize job lateness
Minimize completion time
Minimize time in the system
Minimize overtime
Maximize machine or labor utilization
Minimize idle time
Minimize work-in-process inventory
 The assignment method of loading:
Assignment techniques is a typical optimization techniques
particularly useful in a situation where a certain number of
jobs require to be assigned to equal number of facilities, one
job to each facility.

It is to minimize the total cost assignment of m workers to m

jobs. It involves assignment of people to projects, jobs to
machines, workers to jobs and teachers to classes etc.

One of the important characteristics of assignment problem is

that only one job (or worker) is assigned to one machine (or
project).

An assignment problem is a special case of a transportation

problem in which all supplies and all demands are equal to 1.
1) Resources (Facilities)
2) Activities (Jobs)
3) Effectiveness ( Cost, Profit, time)

Activities J1 J2 Jn Supply
Resources

w1 c11 c12 c1n 1
w2 c21 c22 c2n 1
wn cn1 cn2 cnn 1
Demand 1 1 1
 Network Presentation

c1
1 1
c 1
1
c13
Jobs 2 Employees
c21
c22
2 2
c23
c31
c3
3 2 3
c33
 Mathematical Model

Minimize Z = cijxij
Subject to constraints

xij = 1, for all i (resources available)

xij = 1, for all j (activities requirement)

Xij = 0, 1 , for all i and j.

Where cij represents the cost of assignment of resources

to destination
Steps for solving Assignment Problem
(Hungarian Method):
Step 1: Assignment method can be applied only to a balance
table. Incase the table is unbalanced, introduce dummy row or
dummy column as required.

Step 2: Row Subtraction: Subtract the minimum element of

each row from all element of row.

Step 3: Column Subtraction: Subtract the minimum element

of each column from all element of column.

Step 4: Draw minimum number of horizontal and /or vertical

lines to cover all zero.
Step 5: If the total number of lines covering all zero are equal
to the size of the matrix of the table, we have got the optimal
solution. If not, subtract the minimum uncovered element from
all uncovered elements and add this element to all elements
at the intersection point of the lines covering zero.

Step 6: Repeat steps 4 and 5 till minimum number of lines

covering all zero is equal to the size of the matrix of the table.
Scheduling m job to m machine by Hungarians Method:
A department has five employees and five jobs to be performed.
The time in hours each man will take to perform each job is given
in the matrix:
Employees I II III IV V
Jobs

A 4 6 11 16 9

B 5 8 16 19 9
C 9 13 21 21 13
D 6 6 9 11 7
E 11 11 16 26 11

How should the jobs be allocated ,one per employee, so as to

minimize the total man-hours.
 Home Assignment
Assignment job to machine by using Hungarians Method :

Operators 1 2 3 4 5 6

Machine

A 9 22 58 11 19 27
B 43 78 72 50 63 48
C 41 28 91 37 45 33
D 74 42 27 49 39 32
E 36 11 57 22 25 18
F 3 56 53 31 17 28
The jobs has to route, the set of jobs visiting each machine. The
ordering of the jobs in front of each machine is to be determine. There
are n! ways of ranking-ordering jobs in front of a machine. Since there
are m machines in the shop, the number of alternate schedules that one
can draw is (n!)m.

To get the best solution with the objective minimizing time, cost is
a very difficult job.
 Scheduling
Case 1:Suppose a production facility starts at 9.00 am. Two jobs will
be processed. Job 1 will required 2 hours to process and customer
wants the job done by 1.00 pm. Job 2 can be started not before 10 am.
will required 1 hour to process and customer wants the
job done by 11 am.

Job Ready time Processing Due date

time
1 0 2 4
2 1 1 2

Case 2:
Job Ready time Processing Due date
time
1 0 2 5
2 0 3 3
 Schedule 1

Job 1 Job 2

d2 d1

0 1 2
3 4 Time, t
Schedule 2

Job 2 Job 1

d2 d1

0 1 2 3 4
Time, t

Schedule 2 meets the due dates

 Schedule 3

Job 1 Job 2

d2 d1

0 1 2 3 4 5
Time, t
Schedule 4

Job 2 Job 1

d2 d1

0 1 2 3 4 5
Time, t

Schedule 4 meets the due dates

 Sequencing Jobs Through One Process

Makespan
The earliest time when all the jobs are completed. If the job j
has a completion time (Cj), makespan is given (maximum
completion time) max (Cj). The objective is to minimize
makespan.
Makespan = min max{ci}

Total completion Time

This is a measure of the work in progress inventory in the system.
Total completion time is the sum of the completion times. (Cj)
j=1..n. The objective is to minimize total completion time or
calculate mean completion time.
Total Flow Time

Time between releasing a job into the shop and the time of
completion of the job. Total flow time equals the sum of
processing time of all operations of the job and other non-
productivity time, including waiting and moving various
place in shop.

If job j arrives at time Rj the total Flow time of the job: Fi=
(Cj Rj), j=1..n

The objective is to minimize total flow time or calculate

mean flow time.
 F2

C2

Job 1 Job 2

r2=2
0 1 2 3 4
Time, t
Job 2 completed at 12.00 noon, 3 hours after the start of operation.
Completion time C2= 3 hr
Job 2 arrived at 10.00 am , 1 hr after the start of operation
Flow time (F2) = c2 - r2= 3 - 1= 2 hr
If the jobs are processing at t=0, in static scheduling
Flow time = Completion time if rj=0
Due date based measures (Lateness):

The completion time is compared with the due date and some
assessment of the rules is made. Lateness is the different
between completion time and due date. If the due date for job j
is denoted as Dj then
Lateness of the job Lj = (Cj Dj)
Total lateness Lj. The objective is to minimize total lateness.
Lateness of job may be:
Negative, if the job is early
Zero, if the job is completed right with due date
Positive, if the job is late
Total Tardiness:

When minimizing total lateness, the positive and negative values

will cancel each other. Earliness is not rewarded but lateness is
penalized. So it may be loss of sales and penalties. The positive
lateness is called tardiness.
The tardiness Tj of the job j is:
Tj= max(0, Li). Total tardiness is the j Tj .
Tj= max(0, Cj Dj ).
The objective is to minimize total tardiness.

Number of tardy jobs:

Minimizing the number of tardy jobs particular when tardy jobs
will go to different customers. Several customers would be unhappy
and organization will lose goodwill.
Define Nj =1 if Tj > 0
The objective to minimize the number of tardy jobs. (Min j Nj )
Tardiness:
Difference between a late jobs due date and its
completion time( job completed ahead of time) instead
of negative value of Li zero is consider.
Tardiness is used a non-negative, Zero same as lateness.
Tardiness of the job Ti= max(0, Li)
Job is late (or tardy). Tardiness is set of its lateness.
Schedule 1

Job 1 Job 2

d2 d1

0 1 2 3 4
Time, t
C1= 2, C2=3, D1=4, D2=2 Then L1= C1-D1= 2- 4 = -2
L2= C2- D2= 3- 2 = 1,
T1= max(0, L1)= max(0,-2)=0
Earliness:

In some situation finishing jobs ahead of due date is also not desirable.
Customer is followed just-in-time, Goods can not send to customer
ahead of due date. Finish good inventory increase and inventory
holding cost is increase.
Tardiness has a high penalties. i.e different transport air, goodwill
cost, customers are unhappy
The objective is to minimize the total earliness and tardiness.
Min j (Ej+Tj)

Min j ( Ej+ Tj) where and are weighted objective function

>

Makespan and total flow time are the internal measurement and
others are external measurement as customer condition came as
due date.
 Sequencing n jobs in one machine

Sequencing Rules:
Prioritize jobs assigned to a resource
If no order specified use first-come first-served (FCFS)
Many other sequencing rules exist
Each attempts to achieve to an objective
FCFS - first-come, first-served
LCFS - last come, first served
DDATE - earliest due date
CUSTPR - highest customer priority
SLACK - smallest slack
CR - Critical ratio
SPT - shortest processing time
LPT - longest processing time
 Simple Sequencing Rules

Job (in order Processing Due Date

of arrival Time (days) (days hence)
A 3 5
B 4 6
C 2 7
D 6 9
E 1 2

n jobs in one machine

J1 , J2 ,Jn Machine
Shortest process time (STP): The rule choses the jobs with the
least processing time.

SPT Schedule

Processing Due Date Flow Time

Job Time (days) (days) (days)
E 1 2 0 + 1 = 1
C 2 7 1 + 2 = 3
A 3 5 3 + 3 = 6
B 4 6 6 + 4 = 10
D 6 9 10 + 6 = 16

Total flow time = 1+3+6+10+16 = 36 days

Mean flow time = 36/5 = 7.2 days
FCFS: Order of arrival of jobs

FCFS Schedule
Job (in order Processing Due Date
of arrival Time (days) (days hence) Start Job Time Finish
A 3 5 0 + 3 3
B 4 6 3 + 4 7
C 2 7 7 + 2 9
D 6 9 9 + 6 15
E 1 2 15 + 1 16

Total flow time = 3+7+9+15+16 = 50 days

Mean flow time = 50/5 = 10 days
DDATE: Priority on the basis of the due date

DDATE Schedule

Processing Due Date Flow Time

Job Time (days) (days) (days)
E 1 2 0 + 1 = 1
A 3 5 1 + 3 = 4
B 4 6 4 + 4 = 8
C 2 7 8 + 2 = 10
D 6 9 10 + 6 = 16

Total flow time = 1+4+8+10+16 = 39 days

Mean flow time = 39/5 = 7.8 days
LCFS: Last arrival job process first

LCFS Schedule

Processing Due Date Flow Time

Job Time (days) (days) (days)
E 1 2 0 + 1 = 1
D 6 9 1 + 6 = 7
C 2 7 7 + 2 = 9
B 4 6 9 + 4 = 13
A 3 5 13 + 3 = 16

Total flow time = 1+7+9+13+16 = 46 days

Mean flow time = 46/5 = 9.2 days
Random: Assign priority on a random basis. Generating random
number and making ascending order of the digits.
Random Schedule

Processing Due Date Flow Time

Job Time (days) (days) (days)
D 6 9 0 + 6 = 6
C 2 7 6 + 2 = 8
A 3 5 8 + 3 = 11
E 1 2 11 + 1 = 12
B 4 6 12 + 4 = 16

Total Flow time = 6+8+11+12+16 = 53 days

Mean flow time = 53/5 = 10.6 days
Sequencing Rules

Measurement with Due Date

PROCESSING DUE
JOB TIME DATE
A 5 10
B 10 15
C 2 5
D 8 12
E 6 8
 Rules: FCFS

FCFS START PROCESSING COMPLETION DUE

SEQUENCE TIME TIME TIME DATE TARDINESS
A 0 5 5 10 0
B 5 10 15 15 0
C 15 2 17 5 12
D 17 8 25 12 13
E 25 6 31 8 23
 Table

AVERAGE AVERAGE NO. OF

MAXIMUM
RULE COMPLETION TIME TARDINESS JOBS TARDY
TARDINESS

FCFS 18.60 9.6 3 23

 Rules: DDATE:

DDATE START PROCESSING COMPLETION DUE

SEQUENCE TIME TIME TIME DATE TARDINESS
C 0 2 2 5 0
E 2 6 8 8 0
A 8 5 13 10 3
D 13 8 21 12 9
B 21 10 31 15 16
 A(10-0) 5 = 5
Rules: SLACK B(15-0) - 10 = 5
C(5-0) 2 = 3
D(12-0) 8 = 4
E(8-0) 6 = 2

SLACK START PROCESSING COMPLETION DUE

SEQUENCE TIME TIME TIME DATE TARDINESS
E 0 6 6 8 0
C 6 2 8 5 3
D 8 8 16 12 4
A 16 5 21 10 11
B 21 10 31 15 16
 Critical Ratio Rule

CR considers both time and work remaining

time remaining due date - todays

CR = =
date
work remaining remaining
processing time
If CR > 1, job ahead of schedule
If CR < 1, job behind schedule
If CR = 1, job on schedule
 Rules: CR A(10)/5 = 2.00
B(15)/10 = 1.5
C(5)/2 = 2.50
D(12)/8 = 1.50
E (8)/6 = 1.33
CR START PROCESSING COMPLETION DUE
SEQUENCE TIME TIME TIME DATE TARDINESS
E 0 6 6 8 0
D 6 8 14 12 2
B 14 10 24 15 9
A 24 5 29 10 19
C 29 2 31 5 26
 Rule: SPT

SPT START PROCESSING COMPLETION DUE

SEQUENCE TIME TIME TIME DATE TARDINESS
C 0 2 2 5 0
A 2 5 7 10 0
E 7 6 13 8 5
D 13 8 21 12 9
B 21 10 31 15 16
 Summary

AVERAGE AVERAGE NO. OF MAXIMUM

RULE COMPLETION TIME TARDINESS JOBS TARDY TARDINESS

FCFS 18.60 9.6 3 23

DDATE 15.00 5.6 3 16
SLACK 16.40 6.8 4 16
CR 20.80 11.2 4
26
SPT 14.80 6.0 3
16
Example:
A manufacturing organization is in the process of assessing the
usefulness of SPT and DDATE rules for the purpose of scheduling four
jobs on a machine. The table shows information on the process time
and due date for the jobs. Assume that all the jobs are available for
scheduling at the beginning of the planning horizon so that the release
time is zero. Further, due dates in the table denote the time at which
the components is due at its next stage of manufacturing.

Job Process Due by

number time
1 4 6
2 7 9
3 2 19
4 8 17

Compute the relevant performance measures and comment.

 Job sequencing as per SPT rule: 3-1-2-4

Job sequencing as per DDATE rule: 1-2-4-3

Performance of SPT rule
Process Release Completi Flow Latenes Tardine
ing time on time time s ss
order (Ri) (Ci) (Fi)
3 0 2 2 -17 0
1 0 6 6 0 0
2 0 13 13 4 4
4 0 21 21 4 4
Mean 10.5 10.5 2 2
Maximu 21 21 4 4
m
Minimu 2 2 -17 0
m
Number of tardy jobs: 2; make
Performance of the DDATE rule

Process Releas Completi Flow Latenes Tardine

ing e time on time time s ss
order (Ri) (Ci) (Fi)
1 0 4 4 -2 0
2 0 11 11 2 2
4 0 19 19 2 2
3 0 21 21 2 2
Mean 13.75 13.75 1.5 1.5
Maximu 21 21 2 2
m
Minimu 4 4 -2 0
m
Number of tardy jobs: 3; make
span=21
 Selecting a Sequencing Rule

SPT most useful when shop is highly congested

Use SLACK for periods of normal activity

Use DDATE when only small tardiness values can be

tolerated

Use LPT if subcontracting is anticipated

Use FCFS when operating at low-capacity levels

 Scheduling in Flow shops:

In the flow shop, the number of combinations grows non-linear.

Even a small problem of 10 jobs, the number of alternatives to be
3,628,800. So it is very difficult to compute. Taking a combination
of shop configuration, the scheduling rule and the performance
measure could find out the optimal combination without commutation.
Terminology:
Number of machines: No of service facility through which a job must
pass before it is assumed to be completed .

Processing time: Time required the job on each machine.

Processing Order: order (sequence) in which machines are required for
completing the jobs.

Ideal time on a machine: time for which machine does not have a job to
process i.e. ideal time from the end of the job (n-1) to the start of job i.

Total Elapsed time: Time interval between starting first job and completing
the last job including the ideal time(if any) in a particular order by the
given set of machine.

No passing rule: Rule to maintaining the order in which jobs are to be

processed on given machine. For example, if n jobs are to be processed
on two machines M1 and M2 in the order M1 , then each job should go to
machines M1 first and then M2.
Johnsons rule:
A procedure that minimizes makespan when scheduling a group
of jobs on two workstations.

Step 1. Find the shortest processing time among the jobs not yet
scheduled. If two or more jobs are tied, choose one job
arbitrarily.

Step 2. If the shortest processing time is on workstation 1,

schedule the corresponding job as early as possible. If the
shortest processing time is on workstation 2, schedule the
corresponding job as late as possible.

Step 3. Eliminate the last job scheduled from further

consideration. Repeat steps 1 and 2 until all jobs have been
scheduled.
Step 1: List the jobs with their processing time in a table.

Step 2: Find the smallest processing on machine M1 and M2

i.e. min(t1j, t2j) for all j.

Step 3:The smallest processing time is on first machine M1, then

place corresponding job in the first available position in the sequence.
If it is on second machine M2, then place the corresponding job in the
last available position on sequence.
a)machine, min(t1j, t2j) = t1k = t2r , then process kth job first and rth job
last.
b) If the tie for the minimum occurs among processing time t2j on
machine M2, then select the job corresponding to the largest job
corresponding to the largest job subscript last.

Step 4: Remove the assignment job from the table.

Step 5: Calculate the ideal time for machine M1 and Machine M2:

Ideal time M1= ( makespan)- (time when the last job in a sequence
finishes on machine M1)

Ideal time M2 = (Time at which the first job in a sequence finishes

machine M1) + [(time when the jth job in a sequence starts on
machine M2)- (time when the (j-1)th job in a sequence finishes
on machine M2) j=2 to n
 Processing n-jobs through 2-machines

roblem 1:
nd the sequence that minimize the total elapsed time required to
omplete the following tasks on two machines.

Task A B C D E F G H I

Machine 2 5 4 9 6 8 7 5 4
I
Machine 6 8 7 4 3 9 3 8 11
II
he smallest processing time between two machines is 2 which is ta
n machine I.
A

After the task A process, 8 tasks are left and the processing time w

Task B C D E F G H I
Machine 5 4 9 6 8 7 5 4
I
Machine 8 7 4 3 9 3 8 11
II
The minimum processing time in reduced problem is 3
which
corresponding to task E and G both on machine II.
Since the
corresponding time of task E on machine I is less than
Current partial assignment will be:

A G E

The set process time reduced to:

Task B C D F H I
Machine 5 4 9 8 5 4
I
Machine 8 7 4 9 8 11
II

A C I D G E
 The set process time reduced to:

Task B F H
Machine 5 8 5
I
Machine 8 9 8
II

e smallest processing time in the reduced problem is 5 which

rresponding to task B and H both in machine I. Since the correspo
ocessing time of B and H on machine II is same, either of these tw
sks can be placed in fourth and fifth sequence cells. Thus we an
ternative optimal sequence.
 A C I B H F D G E

A C I H B F D G E

The minimum time for machine I and II is calculated as:

Task Machine I Machine Machine Machine
sequence Time In I Time II Time In II Time
Out Out

A 0 2 2 8
C 2 6 8 15
I 6 10 15 26
B 10 15 26 34
H 15 20 34 42
F 20 28 42 51
D 28 37 51 55
G 37 44 55 58
E 44 50 58 61
e minimum elapsed time i.e. time from start of task A to completio
ask E is 61 hours.

ring this time the machine I remain idle 61-50= 11 hours.

e idle time for machine II is equal to the time at which the first tas
he sequence finishes on machine I plus the last task E in the seque
rts in machine II minus the last but one task G finishes on machine
2+58-58=2 hours.
Problem 2:

A manufacturing company processes 6 different jobs on two machi

and B. Number of unit of each job and its processing time on A and
are given in the table. Find the optimal sequence, the total minimu
elapsed time and the idle time for each machine.

Job No of Machine Machine

Number units of I II
each job processi processi
ng time ng time
1 3 5 8
2 4 16 7
3 2 6 11
4 5 3 5
5 2 9 7.5
6 3 6 14
roblem 3:

here are seven jobs, each of which has to go through the machine
nd B in the order AB. Processing times in hours are as follows:

Jobs 1 2 3 4 5 6 7
Machine 3 12 15 6 10 11 9
A
Machine 8 10 10 6 12 1 3
B
Determine a sequence of these jobs that will minimize the total
elapsed time T. Also find T and ideal time for machine A and B.
 Processing n-jobs through 3-machines
roblem 4:

nd the sequence that minimizes the total time required in perform

he following jobs on three machines in order ABC. Processing time
n hours) are given in table:

Job 1 2 3 4 5
Machine I 8 10 6 7 11
Machine II 5 6 2 3 4
Machine III 4 9 8 6 5
orithm for processing n-jobs though three Machines
The minimum processing time on machine M1 is at least as great
as the maximum processing time on machine M2.
i.e. min t1j max t2j j=1,2n
The minimum processing time on machine M3 is at least as great
as the maximum processing time on machine M2.
i.e. min t3j max t2j j=1,2n

Step-1: Examine process time of given jobs on all three machines and
if either one or both the condition hold then step -2, otherwise the
algorithm fails.

Step-2: Introduce two fictitious machines say G and H and

corresponding times given by:
(i) tGj = t1j+ t2j j=1,2n
i.e. Process time on machine G is the sum of the processing time on
machines M1 and M2.
(i) tHj = t2j+ t3j j =1,2n
i.e. Process time on machine H is the sum of the processing
time on machines M2 and M3.

Step-3: Determine the optimal sequence of jobs for n-jobs,

two machine problem with the prescribed ordering GH as per
n jobs two machine problems.

As per the given problem:

Job: 1 2 3 4 5
Machine G: 8+5=13 10+6=16 6+2=8 7+3=10 11+4=15
Machine H: 5+4=9 6+9=15 2+8=10 3+6=9 4+5=9

Sequence the jobs as per Johnsons Rule:

3 2 5 1 4
em 5:

dymade garments manufacturer has to process items through

tages of production. Viz, cutting and sewing. The time taken for
of these item at the different stages are given below in appropria

1 2 3 4 5 6 7
ssing

g: 5 7 3 4 6 7 12
g: 2 6 7 5 9 5 8
d the order in which these items are to be processed through
stages so as to minimize the total processing time.
ppose a third stage of production is added viz pressing an packing,
processing time for these items as followings:
1 2 3 4 5 6 7
ssing time
ng and Packing: 10 12 11 13 12 10 11
d an order in which these seven items are to be processed so as to
nimize the time taken to process all the items through all the
ree stages.
 Processing n-jobs through 3-machines
roblem 6:

nd the sequence that minimizes the total time required in perform

he following jobs on three machines in order ABC. Processing time
n hours) are given in table:

Job 1 2 3 4 5 6
Machine I 3 12 5 2 9 11
Machine II 8 6 4 6 3 1
Machine III 13 14 9 12 8 13
 Processing n-jobs through m-machines
roblem 7:

nd the optimal sequence for the following sequencing problems of

obs and five machines when passing is not allowed of which proce
me (in hours) is given below

Job Machine Machin Machine Machine Machine

I e II III IV V

A 7 5 2 3 9
B 6 6 4 5 10
C 5 4 5 6 8
D 8 3 3 2 6

Also find the elapsed time.