Sequencing Problems

Abu Bashar

Sequencing???
It is the selection of an appropriate order in which a number of jobs (Operations) can be assigned to to a finite number of service facilities (Machines or equipments) so as to optimize the outputs in terms of time, cost or profit.

Common Sequencing Rules

FCFS. First Come First Served. Jobs processed in the order they come to the shop. SPT. Shortest Processing Time. Jobs with the shortest processing time are scheduled first. EDD. Earliest Due Date. Jobs are sequenced according to their due dates. CR. Critical Ratio. Compute the ratio of processing time of the job and remaining time until the due date. Schedule the job with the largest CR value next.

Two Work Center Sequencing

Johnsons Rule: technique for minimizing completion time for a group of jobs to be processed on two machines or at two work centers. Minimizes total idle time Several conditions must be satisfied

Johnsons Rule Conditions

Job time must be known and constant

Job times sequence

must

be

independent

of

Jobs must follow same two-step sequence Job priorities cannot be used All units must be completed at the first work center before moving to the second

Sequencing Problems
One machine, many jobs Two machines, many jobs Three machines, many jobs Many machines, many jobs

One machine, many jobs

Total time is independent of sequence Sequencing minimizes idle time

Two machines, many jobs

All Jobs follow same sequence Johnsons Rule Jobs have different sequence Jacksons Rule Johnsons 3 machine rule

Johnsons Rule
Johnsons rule: A procedure that minimizes idle time 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.

Example 16.5
Johnsons Rule
Motor Workstation 1 at the Morris Machine Co. Time (hr) Workstation 2

M1 M2 M3 M4 M5

12 4 5 15 10

22 5 3 16 8

Eliminate M3 from consideration. The next shortest time Eliminate M1 and the only job remaining to be Eliminate M5 from consideration. The next shortest time is Eliminate M2 from consideration. The next shortest time is Shortest time is 3 hours at workstation 2, so isat M2 at Workstation 1,schedule so schedule M2 first. scheduled is M4. M1 at workstation #1, so schedule M1 next. M5 workstation #2, so M5 next to last. schedule job M3 last. Sequence = M2 M1 M4 M5 M3

Example 16.5
Johnsons Rule
at the Morris Machine Co.

The schedule minimizes the idle time of workstation 2 and gives the fastest repair time for all five motors. No other sequence will produce a lower makespan.
Gantt Chart for the Morris Machine Company Repair Schedule
Workstation M2 (4) Idle M2 (5) M1 (12) M4 (15) M1 (22) M5 (10) M3 (5) M4 (16) Idleavailable for further work M5 (8) M3 (3)

Idle

10

15

20

25

30

35 Day

40

45

50

55

60

65

Problem

Job A B

1 4 8

2 5 10

3 8 2

4 10 4

5 6 5

6 5 7

7 10 6

8 6 6

Example

Johnsons 3 Machine Rule

Domination Largest on B is not greater than smallest on A or C. Domination guarantees optimality Conversion Convert into a 2 M/C problem as M1 = A + B, M2 = B + C Find optimal sequence for this 2 machine problem Schedule on 3 machines based on the sequence above

Classwork
Job A B C M1 M2 1 8 7 13 15 20 2 6 4 12 10 16 3 10 6 11 16 17 4 7 5 12 12 17 5 9 5 13 14 18 6 7 4 10 11 14

Classwork
j 1 2 3 4 5

tj1 tj2 tj3

8 3 6

11 2 5

7 5 7

6 7 13

9 11 10

Thank You Very Much