Resource Scheduling

I.K. Gunarta Jurusan Teknik Industri - ITS

Project network times are not a schedule until resource availiability has been assured
98

Sasaran Belajar
Setelah mempelajari bab ini, diharapkan siswa dapat:
Mengetahui tipe-tipe kendala proyek. Mengetahui jenis kendala-kendala sumber proyek. Mengetahui klasifikasi permasalahan penjadwalan proyek. Memahami metode alokasi sumber daya. Memahami spliting dan multitasking. Memahami pendekatan rantai kritis. Mengetahui manfaat-manfaat penjadwalan proyek.
99

Materi Konsep dasar penjadwalan sumberdaya Macam kendala proyek Klasifikasi permasalahan dalam penjadwalan Teknis penjadwalan proyek Contoh dan latihan penjadwalan sumber daya pada proyek
100

Latar Belakang
Hampir selalu lebih banyak proyek atau aktivitas dibandingkan dengan sumber daya yang tersedia Permasalahannya adalah bagaimana memilih proyek yang memberikan kontribusi terbaik terhadap tujuan perusahaan dengan kendala-kendala sumber daya yang ada Jika penjadwalan proyek menggunakan komputer, dampak dari adanya proyek yang baru dengan cepat dapat dikenali
101

Permasalahan
Apakah tenaga kerja yang ditugaskan dan/atau peralatan memadai dan tersedia untuk menangani proyek? Apakah kontraktor dari luar harus digunakan? Apakah ada dependensi sumber daya yang tak terduga? Apakah ada jalur kritis baru? Seberapa banyak fleksibilitas yang kita miliki dalam penggunaan sumber daya? Apakah batas waktu yang ada masih realistis untuk dicapai? Jika proyek lain ditambahkan pada proyek yang sudah berjalan atau yang masih direncanakan, apakah akan menyebabkan keterlambatan dalam proyek saya?
102

The Resource Problem Resources and Priorities

Project network times are not a schedule until resources have been assigned.
The implicit assumption is that resources will be available in the required amounts when needed.
Adding new projects requires making realistic judgments of resource availability and project durations.

Cost estimates are not a budget until they have been time-phased. 8103

103

Project Planning Process

FIGURE 8.1

8104

104

Types of Project Constraints

Technical or logic constraints
Usually address the sequence in which project activities must occur.

Resource constraints
When the availability of resource lower than required

Physical Constraints
Ex : renovation of ship compartment might allow only one person to perform an activity because of space limitations.
105

Technical constraints

Pour Design

Frame Code

Roof Test

Purchase refreshments

Resource constraints

Plan

Decorate hall Hire band

Reception

Plan

Hire band

Decorate hall

Purchase refreshments

Reception

106

Kinds of Resource Constraints

PEOPLE

EQUIPMENT

MATERIAL

WORKING CAPITAL

107

Classification of Scheduling Problem

Time Constrained
Test : if the critical path is delayed, will resources be added to get back on schedule? If the answer is yes, assume the project is time constrained; if no, assume the project is resource constrained.

Resource Constrained
The level of resource available cannot be exceeded.
108

Priority Rules Minimum Slack Smallest Duration Lowest Activity Identification Number

109

Time Constrained Network

2 2 4 B 2 6 8 2 10

6 2 8

E 1 2

8 2 10 10 0 G 1 2 12 0 12

0 0 0

A 2 2

2 0 2

2 0 2

C 2 4

6 0 6 6 0 6 F 1 4 10 0 10

10

Legend
ES ID RES DUR EF SLK LF

2 6 8

D 1 2

4 6 SL 10 LS

110

Time Constrained Network

ID RES DUR ES LF TS 0 2 1 2 2 2 1 2 2 1 1 1 1 1 1 1 1 2 2 5 5 4 4 4 4 1 1 1 1 1 2 2 2 2 2 2 2 3 4 5 6 7 8 9 10 11 12

A B C D E F G

2 2 0 2 2 6 2 10 2 4 2 6 1 2 2 10 1 2 6 10 1 4 6 10 1 2 10 12 Total Resource Load

0 2 0 6 2 0 0

Time Constrained Network

ID RES DUR ES LF TS 0 2 1 2 2 2 1 2 2 1 1 1 1 1 1 1 1 2 2 4 4 4 4 4 1 1 2 2 2 2 2 2 2 3 4 5 6 7 8 9 10 11 12

A B C D E F G

2 2 0 2 2 6 2 10 2 4 2 6 1 2 2 10 1 2 6 10 1 4 6 10 1 2 10 12 Total Resource Load

0 2 0
6 0 2 0 0

Time Constrained Network

ID RES DUR ES LF TS 0 2 1 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 2 2 4 4 4 4 3 1 1 1 2 2 2 3 4 5 6 7 8 9 10 11 12

A B C D E F G

2 2 0 2 2 6 2 10 2 4 2 6 1 2 2 10 1 2 6 10 1 4 6 10 1 2 10 12 Total Resource Load

0 2 0
0 2 0 0 0

Resource Constrained Schedule

2 2 4

B 2 6

8 2 10

6 2 8

E 1 2

8 2 10 10 0 G 1 2 12 0 12

0 0 0

A 2 2

2 0 2

2 0 2

C 2 4

6 0 6 6 0 6 F 1 4 10 0 10

10

Legend
ES ID RES DUR EF SLK LF

2 6 8

D 1 2

4 6 SLK 10 LS

114

Resource Constrained Schedule

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 2 2 2 6 6 10

2 10 6 10

0 2 0 6 2 0 0

2 2 2 1 2 2 1 1 1 1 1 1 1 1 1 1 3 0 0 2 2 2 2 2 2

E
F G

1
1 1

2
4 2

10
10 12

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

5 3

5 3

4 3

4 3

1 3

1 3

1 3

Resource Constrained Schedule Periode 0-1

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 2 2 2 6 6 10

2 10 6

0 2 0 6 2 0 0

2 2 2 1 2 2 1 1 1 1 1 1 1 1 1 1 3 0 0 2 2 2 2 2 2

10
10 10 12

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5

2 3

2 3

5 3

5 3

4 3

4 3

1 3

1 3

1 3

Hanya ada satu aktivitas yang dapat dijadwalkan pada waktu ke 0-1 (A) Jadwalkan aktivitas A.

4 3 2 1 0

Resource Constrained Schedule Periode 1-2

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 2 2 2 6 6 10

2 10 6

0 2 0 6 2 0 0

2 2 2 1 2 2 1 1 1 1 1 1 1 1 1 1 3 0 0 2 2 2 2 2 2

10
10 10 12

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5

2 3

2 3

5 3

5 3

4 3

4 3

1 3

1 3

1 3

Hanya ada satu aktivitas yang dapat dijadwalkan pada waktu ke 0-1 (A) Aktivitas A telah terjadwal.

4 3 2 1 0

Resource Constrained Schedule Periode 2-3

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 3 2 2 6 6 10

2 10 6

0 1 0 6 2 0 0

2 2 2 1 2 2 1 1 1 1 1 1 1 1 1 1 3 0 0 2 2 2 2 2 2

10
10 10 12

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

Ada 3 (tiga) aktivitas yang harus dijadwalkan pada periode 2-3. Aktivitas C memiliki slack terendah, jadwalkan aktivitas C. Aktivitas berikutnya yg memiliki slack terendah adalah B, tapi resource yg tersedia hanya 3. Jadwalkan aktivitas C dan geser B satu hari. 5 4 3 2 1 0

2 3

2 3

3 3

5 3

4 3

4 3

3 3

1 3

1 3

Resource Constrained Schedule Periode 2-3

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 3 2 2 6 6 10

2 10 6

0 1 0 6 2 0 0

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 3 0 0 2 2 2 2 2 2 2

10
10 10 12

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

Ada 3 (tiga) aktivitas yang harus dijadwalkan pada periode 2-3. Aktivitas C memiliki slack terendah, jadwalkan aktivitas C. Aktivitas berikutnya yg memiliki slack terendah adalah B, tapi resource yg tersedia hanya 3. Jadwalkan aktivitas C dan geser B satu hari. 5 4 3 2 1 0

2 3

2 3

3 3

5 3

4 3

4 3

3 3

1 3

1 3

Resource Constrained Schedule Periode 3-4

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 4 2 2 6 6 10

2 10 6

0 0 0 6 2 0 0

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 3 0 0 2 2 2 2 2 2 2

10
10 10 12

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

4 3

4 3

3 3

3 3

1 3

Resource Constrained Schedule Periode 4-5

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 5 2 2 6 6 11

2 11 6

0 -1 0 6 2 0 -1

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 0 2 2 2 2 2 2 2

10
10 10 13

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

4 3

3 3

3 3

2 3

1 3

Resource Constrained Schedule Periode 5-6

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 6 6 12

2 12 6

0 -2 0 6 2 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
10 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

3 3

2 3

2 3

Resource Constrained Schedule Periode 6-7

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 7 6 12

2 12 6

0 -2 0 6 1 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
10 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

4 3

3 3

2 3

2 3

Resource Constrained Schedule Periode 7-8

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 8 6 10

2 12 6

0 -2 0 6 0 0 0

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
10 10 12

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

4 3

4 3

2 3

2 3

Resource Constrained Schedule Periode 8-9

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 9 6 12

2 12 6

0 -2 0 6 -1 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
11 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

4 3

3 3

2 3

Resource Constrained Schedule Periode 9-10

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 10 6 12

2 12 6

0 -2 0 6 -2 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
12 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

3 3

3 3

3 3

Resource Constrained Schedule Periode 10-11

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 10 6 12

2 12 6

0 -2 0 6 -2 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
12 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

3 3

3 3

3 3

Resource Constrained Schedule Periode 11-12

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 10 6 12

2 12 6

0 -2 0 6 -2 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
12 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

3 3

3 3

3 3

Resource Constrained Schedule Periode 12-13

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 10 6 13

2 12 6

0 -2 0 6 -2 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
12 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

3 3

3 3

3 3

Resource Constrained Schedule Periode 13-14

ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

A B C D

2 2 2 1

2 6 4 2

0 6 2 2 10 6 12

2 12 6

0 -2 0 6 -2 0 -2

2 2 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2

10
12 10 14

E
F G

1
1 1

2
4 2

Total Resource Load Resource Available

5 4 3 2 1 0

2 3

2 3

3 3

3 3

2 3

2 3

3 3

3 3

3 3

3 3

Resource Constrained Schedule through Period 5-6

6 0 6

B 2 6

12 0 12

10 0 10

E 1 2

12 0 12 12 0 G 1 2 14 0 14

0 0 0

A 2 2

2 0 2

2 0 2

C 2 4

6 0 6 6 0 6 F 1 4 10 0 10

12

Legend
ES ID RES DUR EF SLK LF

2 2 4

D 1 2

4 2 SLK 6 LS

131

Original Network Plan

0 4 4 1 1A 2 2 4 6 2 4 6 0 6 6 2 1A 3 3 6 9 4 0 0 0 0 3 2B 4 4 0 4 4 5 2C 5 9 0 9 9 0 9 8 2B 3 12 0 12 12 0 12 4 5 9 9 2A 3 7 5 12 11 2C 5 17 0 17 4 2C 3 5 4 9 9 1 10 7 2B 5 14 1 15
ES SLK LS

2 8 10

6 2A 5

7 8 15 14 1 15 10 2A 2 16 1 17

Resources available, 2 each of A, B, C

Legend
ID RES DUR EF SLK LF

132

Original Network Plan

Resource loading chart
0 1 2 3 4 5 6 7 8 9 10 11 12
13 14 15 16 17 18 19 20

A B C

2 1

S 3 4 S

6 8 5

S S S S S S 7 11

10

S S

Plan schedule
ACT 1 2 3 4 5 6 7 8 9 10 11 ES 0 0 0 2 4 2 9 9 4 14 12 LS 4 6 0 6 4 10 10 9 9 15 12 EF 2 3 4 5 9 7 14 12 7 16 17 LF 6 9 4 9 9 15 15 12 12 17 17 Slack 4 6 0 4 0 8 1 0 5 1 0

New resource schedule

ACT 1 2 3 4 5 6 7 8 9 10 11 RES 1A 1A 2B 2C 2C 2A 2B 2B 2A 2A 2C ESR 0 0 0 2 5 7 13 10 4 18 13 LSR 0 7 1 2 5 13 13 10 10 18 15 EFR 2 3 4 5 10 12 18 13 7 20 18 LFR 2 10 5 5 10 18 18 13 13 20 20 Slack 0 7 1 0 0 6 0 0 6 0 2

Splitting/Multitasking

Activity duration without splitting

Activity A

Activity B

Activity C

Activity duration split into three segmentsA, B, C

Activity A

Activity B

Activity C

Startup

Shutdown
134

Activity duration split with shutdown and startup

Responsibility Matrix for a Market Research Project

R = Responsible S = Supports/assists
Task Identify target customers Develop draft questionnaire Pilot-test questionnaire Finalize questionnaire Print questionnaire Prepare mailing labels Mail questionnaires Receive and monitor returned questionnaires Input response data Analyze results Prepare draft of report Prepare final report S R R R R S S S S S R R R R

Project team
Richard Dan Dave Linda Elizabeth S S R S S S S S R R R S S

Responsibility Matrix for the Computer Controlled Conveyor Belt Project

Organization
Design Deliverables Architechural design Hardware specifications Kernal specifications Utilities specification Hardware design Disk drivers Memory management Operating system documentation Prototypes Integrated acceptance test 1 2 1 2 1 3 1 2 5 5 2 1 3 2 1 4 2 1 3 1 3 3 5 2 3 3 4 5 Develop- Documen- Assembly ment tation 2 1 3 1 3 3 3 3 Testing 2 2 Purchas- Quality Manufacing assurance turing 3 3 3 3

Legend 1 Responsible 3 Consult 5 Approval 2 Support 4 Notification

136

Direct Labor Budget Rollup ($000)

FIGURE 8.12

8137

Time-Phased Work Package Budget (Labor Cost Only)

FIGURE 8.13

8138

Two Time-Phased Work Packages (Labor Cost Only)

FIGURE 88.14 139

Patient Entry Project Network

FIGURE 8.15

8140

Patient Entry Time-Phased Work Packages Assigned

FIGURE 88.16 141

CEBOO Project Monthly Cash Flow Statement

FIGURE 88.17 142

CEBOO Project Weekly Resource Usage Schedule

FIGURE 88.18 143