PPC Shop Floor Planning

Job Shop Scheduling

Single processor scheduling. One product at a time from the machine / process Flow shop scheduling. Job contains several operations that are to be performed in a specific order. Operations are carried out in more than one processor. General shop scheduling More than two machines & two jobs. Flow of work can take any pattern.
2

6/2/2013

Case Scheduling Procedure

The adjacent table Job gives details of production time & due 1 dates of 4 jobs. Prepare schedule 2 by SPT & DD method. Compare the 3 tardiness obtained from these methods. 4
6/2/2013

Prod Time 4 7
2 8

Due Date 6 9
19 17
3

Case Scheduling Procedure (By - DD Method)

Job (a) Due Processing Completion Tardiness Date time time (d) = +ve (b) (c) (d) = cum of (d) (b) of (c)

1
2 4
6/2/2013

6
9 17 19

4
7 8 2

4
11 19 21

0
2 2 2
4

Case Scheduling Procedure (Single Machine) (By - SPT Method)

Job Processing Due Completion Tardiness time Date time (d) = +ve (b) (c) (d) = cum of of (d) (a) (b) (c)

3
1 2 4
6/2/2013

2
4 7 8

19
6 9 17

2
6 13 21

0
0 4 4
5

Johnsons Procedure (Two Machines)

Step 1: Determine the minimum processing time on either machine. Step 2 A: If the minimum processing time occurs on machine 1, place the associated job in the first available position in the sequence. Step 2 B: If the minimum processing time occurs on machine 2, place the associated job in the last available position in the sequence. Step 3: (a) The job sequenced by either step 2A or 2B is removed from consideration. (b) Repeat the process starting from step 1, until all the jobs are sequenced. (c) Ties can be broken arbitrarily.

6/2/2013

Case Flow Shop Scheduling

There are two machines & five jobs. All the jobs are first processed on machine 1 & then on machine 2. The processing time of the jobs on two machines is given in the table. Design a scheduling process to minimize the make-span.

Jobs
1 2 3

PT* Mc-1 4
6 2

PT* Mc-2 7
3 3

4
5

7
8

7
6

6/2/2013

* PT- Processing Time. Mc- Machine 7

Schedule Sequence using Johnsons Procedure

2
M 1 J3 J1 J3

6
J4 J1

1 3
J5 J4

2 1
J2 J5

2 7

M 2

J2

1 3

2 0

2 7

3 0

6/2/2013

Commonly Employed Rules for General Job Shop Scheduling

Earliest due date ( EDD). Priority is given to the job with the earliest due date. First in system first served (FISFS). Priority is given to the job that arrived first. First come first served (FCFS). Priority is given to the job that arrived at the machine first.

6/2/2013

Commonly Employed Rules for General Job Shop Scheduling

Least Slack First (LSF). Priority is given to the processing of the job that has least slack. Slack is the difference between the due date & the work remaining on the job. Shortest processing time (SPT). Priority is given to the job with the shortest processing time on the machine. Least work remaining (LWR). Priority is given to the job with the least amount of processing to be done.
10

6/2/2013

Case General Job Shop Scheduling

6 jobs are to be processed on three machines (A,B,C) as per details given in the Table. For example, Job A will take 3days on machine A, 3days on B, & 2days on machine C. Its due date is 10 days. Prepare schedules for general job shop for the rules discussed earlier.

Job Sequence & Due Processing Date Time

1 2
3 4

A(3),B(3),C(2) A(5),C(2)
B(4),A(4),C(3) B(3),C(5),A(2)

10 13
12 18

5
6/2/2013

C(5),B(4) C(2),A(5),B(5)

14 15 11

Case General Job Shop Scheduling EDD Sequencing

Job Sequence & Due Processing Date Time
1
2

Job
1

EDD Sequence
A(3),B(3),C(2)

Due Date
10

A(3),B(3),C(2)
A(5),C(2)

10
13

3
2 5 6 4

B(4),A(4),C(3)
A(5),C(2) C(5),B(4) C(2),A(5),B(5) B(3),C(5),A(2)

12
13 14 15 18
12

3
4

B(4),A(4),C(3)
B(3),C(5),A(2)

12
18

5
6
6/2/2013

C(5),B(4)
C(2),A(5),B(5)

14
15

Case General Job Shop Scheduling Gantt Chart

Scheduling Rule : EDD
Time Mach A J-1 Mach B J-3 Mach C J-5 Jobs Finished J-6 J-1 1 J-2 2 5
Idle

10

11

12

13

14

15

16

17

18

19

20

21

22

J-2

J-3

J-6

Idle

J-4

J-1

J-5

J-4

Idle

J-6

J-3 3

J-4

Idle 4 6

6/2/2013

13

Case General Job Shop Scheduling EDD Sequencing - Tardiness

Job Schedule 1 2
3 4

Process Time & Sequence

A(3),B(3),C(2) A(5),C(2)
B(4),A(4),C(3) B(3),C(5),A(2)

Processing Due Tardiness Time Date 9 15

11
11

10 13
12
18

0 2
0 0

5
6/2/2013

C(5),B(4) C(2),A(5),B(5)

22 22

14 15

8 7 14

Case General Job Shop Scheduling Gantt Chart

Scheduling Rule : FISFS
Time Mach A J-1 Mach B J-3 Mach C J-5 Jobs Finished J-6 J-1 1 J-2 2 J-4 5 J-3 3 4 Idle 6 J-1 J-4 J-5 Idle J-6 J-2 J-3 J-6 J-4 Idle 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

6/2/2013

15

Case General Job Shop Scheduling FISFS Sequencing - Tardiness

Job Schedule 1 2
3 4

Process Time & Sequence

A(3),B(3),C(2) A(5),C(2)
B(4),A(4),C(3) B(3),C(5),A(2)

Processing Due Tardiness Time Date 9 11

19
19

10 13
12
18

0 0
7 1

5
6/2/2013

C(5),B(4) C(2),A(5),B(5)

14 22

14 15

0 7 16

Case General Job Shop Scheduling Gantt Chart

Scheduling Rule : FCFS
Time Mach A J-1 Mach B J-3 J-4 J-1 J-5 Idle J-6 J-2 J-3 J-6 J-4 Idle 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

Mach C
J-5 Jobs Finished J-6 J-4 J-2 2 5 J-1 1 J-3 3 4 Idle 6

6/2/2013

17

Case General Job Shop Scheduling FCFS Sequencing - Tardiness

Job Schedule 1 2
3 4

Process Time & Sequence

A(3),B(3),C(2) A(5),C(2)
B(4),A(4),C(3) B(3),C(5),A(2)

Processing Due Tardiness Time Date 16 14

19
19

10 13
12
18

6 1
7 1

5
6/2/2013

C(5),B(4) C(2),A(5),B(5)

14 22

14 15

0 7 18

Summary of the Performance of Scheduling Rules

Rule
EDD FISFS

No of Tardy Jobs 3
3

Ti
17 15

FCFS

22

6/2/2013

19