IE 514 Scheduling
Homework 1
This homework is due in class on Monday, February 3rd
1. Design a composite dispatching rule to solve the problem where two machines are
configured in parallel and the objective is to minimize the makespan (Cmax ). You can
assume that there are n jobs that are all released immediately, there are no due dates, and
that no preemption are allowed. Each job j can be processed on a subset M j ⊆ M of
the set of all machines M = {1,2}, j = 1,2,..., n . Make sure that you clearly explain the
motivation behind the rule and how any parameter(s) should be determined.
2. Apply your composite rule from Question 1 above to the following data sets and
compare it to the simple dispatching rules used to make up the composite rule.
a)
ID
pj
1
9
2
4
3
3
4
5
5
7
Mj
{1,2} {1}
{1}
{1}
{1,2}
ID
pj
1
9
2
4
3
3
4
5
5
7
Mj
{1,2}
{1,2}
{1,2}
{1,2}
{1,2}
b)
3. Do problem 2.6 from the textbook.
4. Do problem 2.10 from the textbook.
5. Do problem 3.2 from the textbook.