PROLEC2 Case 2 Parallel Machines, Batch Scheduling and Flowshop scheduling 1.

Ten jobs need to be processed by either one of three non-identical parallel machines (M1, M2, M3). Allocate the jobs to minimize makespan. Non-preemption is enforced. Job 1 2 3 4 5 6 7 8 9 10 M1 M2 M3 10 7 18 5 4 12 10 5 12 9 7 15 12 9 19 5 4 10 10 7 14 8 7 9 11 9 20 13 10 15

2. Ten jobs need to be processed through a baking oven which can process only 3 jobs at a time. Once the batch has begun baking, it would take 3 days to finish baking. Schedule the batches to meet due dates and to minimize makespan (total baking+idle days) Job 1 2 3 4 5 6 7 8 9 10 Arrival DueDate 1 3 1 4 2 4 2 5 3 6 4 6 4 7 4 8 5 8 5 10

3. Seven jobs of three different part types need to be worked on by a processing center. Sequence the jobs through the center to minimize total tardiness. Job 1 2 3 4 5 6 7 Proc.time DueDate Job Type SetupTime 2 40 1 2 3 22 2 1 6 14 3 3 4 33 1 2 5 19 2 1 1 27 2 1 2 35 3 3

4. A flowshop requires jobs to go through Machine A then B. The expected processing times per machine is given below. Use Johnsons rule to minimize makespan. Job 1 2 3 4 5 6 7 8 A B 30 10 5 22 23 35 24 12 9 18 11 28 18 15 28 33

5. A flowshop requires jobs to go through Machine A >B>C. Schedule the jobs to minimize makespan using (a) Campbell-Dudek-Smith procedure (b) Palmers Slope algorithm and (c) Excel Premium Solvers solution Job 1 2 3 4 5 6 7 A B C 12 6 9 15 7 18 7 4 10 23 12 26 14 7 11 19 10 22 6 3 3

1. Minimizing makespan of non-identical parallel machines

Optimal Job Scheduling

1 2 3 4 5 6 7 8 9 10

M3

14

15

M2

M1

11

For this type of problem, manual scheduling was used to determine the optimal schedule for assigning the jobs on non-identical parallel machines. The largest makespan from the given schedule resulted to 29 units of time. Both machines 2 and 3 have a makespan of 29 units of time and machine 1 only resulted to 28 units of time. 2. Minimizing makespan of scheduled batches

Jobs
Start Finish Tardy

1
1 4 1

2
1 4 0

3
4 7 3

4
4 7 2

5
4 7 1

6
7 10 4

7
7 10 3

8
7 10 2

9
10 13 5

10
10 13 3

For this problem, we batched those jobs with similar start time. This resulted to a makespan of 13 days in completing all ten jobs.

3. Minimizing total tardiness of sequenced jobs in batches

Batch 1 2

Job 3 7 5 2 6 4 1

Setup 3 0 1 0 0 2 0

Process 6 2 5 3 1 4 2

Completion Duedate 5 14 7 35 13 19 16 18 17 27 23 33 25 40

Slack 9 28 6 2 10 10 15

Tardy 0 0 0 0 0 0 0

For this problem, we sequenced the jobs into batches. The criterion was to batch those with similar setup time. The batching of the jobs did not lead to any one of them being tardy. 4. Minimizing makespan of flowshop

Job Machine A Machine B

2 5
22

5 9
18

6 11
28

3 23
35

8 28
33

7 18
15

4 24
12

1 30
10

Using Johnsons Rule, we arrived at this sequence of jobs and the makespan for this flowshop is 178 units of time. 5. Miniming makespan of flowshop through given heurisitcs a) Campbell-Dudek-Smith Set k = 1 Job 1 2 3 4 5 6 7 Sequence: 3 2 4 Set k = 2 Job A 1 18 2 22 3 11 4 35 5 21 6 29 7 8 Sequence: 3 2 4 6 5

A 12 15 7 23 14 19 6 6 5

B 9 18 10 26 11 22 3 1 7

B 15 25 14 38 18 32 6 1 7

Using this algorithm, the minimum makespan resulted to 144 units of time.

b) Palmers Algorithm This algorithm we use the slope index equation resulting Sj for each job is given below. Job 1 2 3 4 5 6 7 Sj -6 6 6 6 -6 6 -6 [ ( )] . The

Sequence 5 , 6th, or 7th 1st, 2nd, 3rd, or 4th 1st, 2nd, 3rd, or 4th 1st, 2nd, 3rd, or 4th 5th, 6th, or 7th 1st, 2nd, 3rd, or 4th 5th, 6th, or 7th
th

Given this situation, we test for all possible sequences and the resulting sequence is given below with a minimum makespan of 125. 2 c) Excel Solver 3 6 4 5 7 1

Sequence 1 2 3 4 5 6 7

Job 2 3 6 4 5 7 1

Start 0 15 22 41 64 78 84

Machine A Process 15 7 19 23 14 6 12

End 15 22 41 64 78 84 96

Start 15 22 41 64 78 85 96

Machine B Process 7 4 10 12 7 3 6

End 22 26 51 76 85 88 102

Start 22 40 51 76 102 113 116

Machine B Process 18 10 22 26 11 3 9

End 40 50 73 102 113 116 125

In using the excel solver, we arrived at the same sequence that was arrived when using palmers algorithm. The minimum makespan for this sequence is 125 units of time.