Scribd
Upload
26 views3 pages

CoMet Exercises Scheduling

The document provides 7 scheduling problems involving jobs that must be scheduled on machines. For each problem, it provides the relevant data and asks to determine the optimal sequence and/or assignment of jobs to machines according to different objectives like minimizing maximum completion time or weighted sum of completion times. It also asks for the corresponding Gantt charts and objective values.

Uploaded by

s.fatima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views3 pages

CoMet Exercises Scheduling

The document provides 7 scheduling problems involving jobs that must be scheduled on machines. For each problem, it provides the relevant data and asks to determine the optimal sequence and/or assignment of jobs to machines according to different objectives like minimizing maximum completion time or weighted sum of completion times. It also asks for the corresponding Gantt charts and objective values.

Uploaded by

s.fatima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Computational Methods - 2023/2024 Carlo Filippi - DEM - UniBS

Algorithms for Scheduling Problems


Exercises

1. Six jobs must be scheduled on a single machine. Each job has a specific
processing time and a priority (weight). A manager wants to schedule the
jobs to minimize the weighted sum of completion times. The data are as
follows:

j 1 2 3 4 5 6
pj 10 5 6 8 8 10
wj 8 5 4 6 7 7

Apply a suitable rule to minimize the given objective.


Draw the corresponding Gantt chart.
The sequence is ...
The objective value is ...

2. In the previous exercise, assume the jobs have no priority (weight). What
rule should you use to minimize the sum of (unweighted) completion times?
What would be the solution? And the objective function value?

3. Five jobs must be scheduled on a single machine trying to respect strict due
dates. The processing times and the due dates are as follows:

j 1 2 3 4 5
pj 5 6 7 5 4
dj 20 10 8 25 21

Sequence the jobs to minimize the maximum lateness.


Draw the corresponding Gantt chart.
The sequence is ...
The maximum lateness is ...

4. Five jobs must be scheduled on a machine in order to minimize the maximum


completion time. Each job can start only after a specified point in time. Data
are as follows:

j 1 2 3 4 5
pj 6 8 6 10 4
rj 2 24 8 14 2

Page 1 of 3
Computational Methods - 2023/2024 Carlo Filippi - DEM - UniBS

Apply a suitable rule to sequence the jobs.


Draw the corresponding Gantt chart.
The sequence obtained is ...
The value of the objective is ...

5. Five jobs must be scheduled on a machine in order to minimize the sum of


the completion times. Each job can start only after a specified point in time.
Data are as follows:

j 1 2 3 4 5
pj 6 8 6 10 4
rj 2 24 8 14 2

Apply a suitable rule to sequence the jobs.


Draw the corresponding Gantt chart.
The sequence obtained is ...
The value of the objective is ...

6. Eight jobs must be scheduled on three identical machines to minimize maxi-


mum completion time. Data are as follows:

j 1 2 3 4 5 6 7 8
pj 4 12 6 7 11 8 9 3

Apply a suitable rule to assign jobs to machines.


Draw the corresponding Gantt Chart.
The obtained maximum completion time is ...

7. Eight jobs must be scheduled on three identical machines to minimize the


sum of completion times. Data are as follows:

j 1 2 3 4 5 6 7 8
pj 4 12 6 7 11 8 9 3

Apply a suitable rule to assign jobs to machines.


Draw the corresponding Gantt Chart.
The obtained total completion time is ...

Page 2 of 3
Computational Methods - 2023/2024 Carlo Filippi - DEM - UniBS

Solutions:

1. We apply the Weighted Shortest Processing Time rule. The sequence is 2-5-
1-4-6-3. The weighted sum of completion times is 961.

2. We apply the Shortest Processing Time rule. The sequence is 2-3-4-5-1-6


(but there are ties). The weighted sum of completion times is 146.

3. We apply the Earliest Due Date rule. The sequence is 3-2-1-5-4. The maxi-
mum lateness is 3.

4. We apply the Earliest Release Time rule. The sequence is 1-5-3-4-2. The
maximum completion time is 36.

5. We apply the Earliest Completion Time rule. The sequence is 5-1-3-4-2. The
sum of completion times is 100.

6. We apply the Longest Processing Time rule. We assign 2-3-8 (or 2-3) to
Machine 1; 5-4 (or 5-4-8) to Machine 2; 7-6-1 to Machine 3. The maximum
completion time is 21.

7. We apply the Shortest Processing Time rule. We assign 8-4-5 to Machine 1;


1-6-2 to Machine 2; 3-7 to Machine 3. The total completion time is 95.

Page 3 of 3

You might also like