SSCM 4823 :

SCHEDULING
CHAPTER 1
INTRODUCTION TO
SCHEDULING
(Part
DR SYARIFAH ZYURINA
NORDIN4)
C10-329
07-5534341
szyurina@utm.my
Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION
field Processor environment
We consider as an empty symbol
and the field can be divide in1 ,
2 and 3 groups. The following are
the notation described for all the s.

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION
field Task characteristic
The next field is field and
determines the characteristic of the
task. The notation of
1 , 2 , 3 , 4 ,
5,6
are as follows:
Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION
field performance criteria
In the last field, represents the
performance criteria that minimizing
the completion time, flow- time and
due-date function.

Scheduling 2nd edition

Syarifah Zyurina

1.6 THREE-FIELD
REPRESENTATION

Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

PROBLEM 1
Consider an instance of P2 | prec | Cmax with 10 jobs and the following
processing times.
job i
pi

1 2 3 4 5 6 7 8 9 10
8 7 7 2 3 2 2 8 8 15

The jobs are subject to the precedence constraints depicted in

Figure 1

Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Figure 1 : Precedence constraints graph for Problem 1

Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Activity 1:
Provide a Gantt charts of non-delay
schedules for the problem given

Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Original schedule

Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Activity 2 :
Assume that the optimal solution for the
makespan is 31 unit. One would expect that,
if each one of the ten processing time is
reduced by one unit, the makespan would be
less that 31. Provide a Gantt chart of nondelay schedules if all the processing time for
each task is one unit shorter
Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Processing time one unit shorter

Scheduling 2nd edition

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Activity 3:
Suppose that an additional machine is
made available and that there are now
three machines instead of two. One would
again expect the makespan with the
original set of processing times to be less
than 31. Provide a Gantt chart with nondelay schedules with 3 machines
Scheduling 2nd edition
21

SZYURINA 2013/2014/1

Syarifah Zyurina

1.7 HANDS ON ACTIVITY

Original processing time and three machine

Scheduling 2nd edition

22

SZYURINA 2013/2014/1

Syarifah Zyurina