JOB SEQUENCING

Problem SQ1**
Six jobs are to be processed on two machines. The processing time (in days) for each
job on each machine is given below. Find the sequence of jobs that minimizes the total
elapsed time to complete the jobs. Also calculate the minimum elapsed time. Draw a
Gantt Chart for the required sequence of jobs and indicate idle time on the Gantt Chart.
(The jobs are to be processed first on Machine M1).
-------------------------------------------------------------------------
Jobs  A B C D E F
Machine 
-------------------------------------------------------------------------
M1 4 8 3 6 7 5
M2 6 3 7 2 8 4
-------------------------------------------------------------------------

Problem SQ2**
Find the sequence that minimizes the total elapsed time (in hours) required to complete
the following jobs on three machines M1, M2, M3 in the order M1 M2  M3.
ii) Find the minimum processing time.
iii) Draw a Gantt chart.
-----------------------------------------------------
Job  A B C D E
M/c 
-----------------------------------------------------
M1 5 7 6 9 5
M2 2 1 4 5 3
M3 3 7 5 6 7
-----------------------------------------------------

Problem SQ3**
Solve the following sequencing problem:
--------------------------------------------------------------------
Jobs 
M/C  A B C D E
--------------------------------------------------------------------
M1 10 12 8 15 16
M2 3 2 4 1 5
M3 5 6 4 7 3
M4 14 7 12 8 10
---------------------------------------------------------------------
ii) Find the minimum processing time.
iii) Draw a Gantt chart.
Problem SQ4**
Three products A, B, C, have to be produced on 3 Machines, M1, M2, & M3. The
sequence of operation & time are given below:
----------------------------------------------------------------------------------------
Product  Operation M/c. Operating
No. time days
----------------------------------------------------------------------------------------
1 M1 7
A 2 M2 5
3 M3 6
-----------------------------------------------------------------------------------------
1 M2 3
B 2 M3 9
3 M1 2
-----------------------------------------------------------------------------------------
1 M1 8
C 2 M3 4
3 M2 3
----------------------------------------------------------------------------------------
Suggest a schedule by which the production of all the three products can be completed
in the shortest possible time. Indicate schedule on Gantt chart.
Problem SQ5**
The following table shows the details of four jobs to be processed through four
machines. Find suitable schedule to complete the jobs in minimum possible elapsed
time, while maintaining required sequence of operations. Indicate schedule on Gantt
chart.
-------------------------------------------------------------------------------------
Jobs Operation Time (Hours) Routing to Machine
 1 2 3 4 1 2 3 4
-------------------------------------------------------------------------------------
A 2 3 2 1 M1 M2 M3 M4
B 4 2 3 - M2 M3 M1 -
 C 1 5 4 - M1 M2 M3 -
D 4 3 2 2 M2 M3 M4 M1
-------------------------------------------------------------------------------------

Problem SQ6**
The sequence of operation of 3 jobs on 4 Machines & operation times in days is given
in the following table:
------------------------------------------------------------
Job Operation M/c. Operating
 No. time days
------------------------------------------------------------
1 M2 2
A 2 M3 4
3 M4 6
4 M1 3
------------------------------------------------------------
1 M1 2
B 2 M2 3
3 M3 4
-------------------------------------------------------------
1 M1 4
C 2 M3 5
3 M4 3
---------------------------------------------------------------
No change is possible in the operation sequence. Assuming that all Machines are
available for scheduling from today, suggest a schedule by which the production of all
three product can be complete in the shortest possible time.

The M/c operating cost per day is:

M1- Rs. 50, M2 – Rs. 40, M3 – Rs. 100, M4 - Rs. 50. If the cost of idle time is 80% of
the above, what will be the corresponding production cost?

SOLUTION TO JOB SEQUENCING

Problem SQ1**
C  A  E F B  D
Minimum time = 35 days

Problem SQ2**
E  B  D  C  A, or E  D  C  B  A, or B  E  D  C  A
Minimum time = 40 hr.

Problem SQ3**
C  A E  D  B
Minimum time = 76 Units

Problem SQ4**
Minimum time = 25 days

Problem SQ5**
Minimum time = 20 hr.

Problem SQ6**
Minimum time = 15 days
Corresponding Cost = Rs. 3360