2012 09 03 Resource Scheduling
-
Upload
fadhila-khairunnisa -
Category
Documents
-
view
86 -
download
0
Transcript of 2012 09 03 Resource Scheduling
98
Resource Scheduling
I.K. Gunarta
Jurusan Teknik Industri - ITS
Project network times are not
a schedule until resource
availiability has been assured
99
Sasaran Belajar
• 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.
Setelah mempelajari bab ini, diharapkan siswa dapat:
100
Materi
• Konsep dasar penjadwalan
sumberdaya
• Macam kendala proyek
• Klasifikasi permasalahan dalam
penjadwalan
• Teknis penjadwalan proyek
• Contoh dan latihan penjadwalan
sumber daya pada proyek
101
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
102
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?
103
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. 8–103
104
Project Planning Process
8–104
FIGURE 8.1
105
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.
106
Pour Frame Roof
Design Code Test Te
ch
nic
al
co
ns
tra
ints
Plan
Purchase
refreshments
Reception Decorate
hall
Hire band
Re
so
urc
e c
on
str
ain
ts
Plan Hire band Decorate
hall
Purchase
refreshments Reception
107
Kinds of Resource Constraints
PEOPLE
MATERIAL EQUIPMENT
WORKING CAPITAL
108
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.
109
Priority Rules
• Minimum Slack
• Smallest Duration
• Lowest Activity Identification Number
110
2 B 8
2 2 2
4 6 10
2 C 6
0 2 0
2 4 6
2 D 4
6 1 6
8 2 10
0 A 2
0 2 0
0 2 2
ES ID EF
SL RES SLK
LS DUR LF
6 F 10
0 1 0
6 4 10
10 G 12
0 1 0
10 2 12
6 E 8
2 1 2
8 2 10
Legend
Time Constrained Network
A 2 2
B 2 6
C 2 4
D 1 2
E 1 2
F 1 4
G 1 2
Total Resource Load
2
2
2 2
2 2 2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 5 5 4 4 4 4 1 1 1 1
Time Constrained Network
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12
0
2
6
6
10
2
10
6
10
10
10
12
0
2
0
6
2
0
0
A 2 2
B 2 6
C 2 4
D 1 2
E 1 2
F 1 4
G 1 2
Total Resource Load
2 2
2 2 2 2 2 2
2 2 2 2
1 1
1 1 1 1
1 1
2 2 4 4 4 4 4 4 2 2 1 1
Time Constrained Network
1 1
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12
2
2
0
2
6
6
10
2
10
6
10
10
10
12
0
2
0
6
2
0
0
0
A 2 2
B 2 6
C 2 4
D 1 2
E 1 2
F 1 4
G 1 2
Total Resource Load
2
Time Constrained Network
2
2 2 2 2 2 2
2 2 2 2
1 1 1 1
1 1
1 1
2 2 4 4 4 4 3 3 3 3 1 1
1 1
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12
2
2
0
2
6
6
10
2
10
6
10
10
10
12
0
2
0
0
2
0
0
0
114
Resource Constrained Schedule
2 B 8
2 2 2
4 6 10
2 C 6
0 2 0
2 4 6
2 D 4
6 1 6
8 2 10
0 A 2
0 2 0
0 2 2
ES ID EF
SLK RES SLK
LS DUR LF
6 F 10
0 1 0
6 4 10
10 G 12
0 1 0
10 2 12
6 E 8
2 1 2
8 2 10
Legend
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
2
2
6
6
10
2
2
10
6
10
10
10
12
0
0
0
0
6
2
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 5 5 4 4 4 4 1 1 1 1 0 0
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
2
2
6
6
10
2
2
10
6
10
10
10
12
0
0
0
0
6
2
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 5 5 4 4 4 4 1 1 1 1 0 0
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 0-1
0
1
2
3
4
5
• Hanya ada satu aktivitas
yang dapat dijadwalkan
pada waktu ke 0-1 (A)
• Jadwalkan aktivitas A.
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
2
2
6
6
10
2
2
10
6
10
10
10
12
0
0
0
0
6
2
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 5 5 4 4 4 4 1 1 1 1 0 0
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 1-2
0
1
2
3
4
5
• Hanya ada satu aktivitas
yang dapat dijadwalkan
pada waktu ke 0-1 (A)
• Aktivitas A telah
terjadwal.
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
3
2
6
6
10
2
2
10
6
10
10
10
12
0
0
0
0
6
1
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 3 5 4 4 4 4 3 1 1 1 0 0
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 2-3
0
1
2
3
4
5 • 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.
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
3
2
6
6
10
2
2
10
6
10
10
10
12
0
0
0
0
6
1
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 3 5 4 4 4 4 3 1 1 1 0 0
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 2-3
2
0
1
2
3
4
5 • 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.
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
4
2
6
6
10
2
2
10
6
10
10
10
12
0
0
0
0
6
0
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 3-4
2 2
2 2 3 3 4 4 4 4 3 3 1 1 0 0
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
5
2
6
6
11
2
2
11
6
10
10
10
13
0
0
-1
0
6
-1
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 4-5
2 2 2
2 2 3 3 2 4 4 4 3 3 2 1 1 0
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
6
6
12
2
2
12
6
10
10
10
14
0
0
-2
0
6
-2
2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 5-6
2 2 2 2
2 2 3 3 2 2 4 4 3 3 2 2 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
7
6
12
2
2
12
6
10
10
10
14
0
0
-2
0
6
-2
1
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
2 2 3 3 2 2 3 4 4 3 2 2 1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 6-7
2 2 2 2
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
8
6
10
2
2
12
6
10
10
10
12
0
0
0
0
6
-2
0
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 7-8
2 2 2 2
2 2 3 3 2 2 3 3 4 4 2 2 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
9
6
12
2
2
12
6
10
11
10
14
0
0
-2
0
6
-2
-1
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 8-9
2 2 2 2
1
2 2 3 3 2 2 3 3 3 4 3 2 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
10
6
12
2
2
12
6
10
12
10
14
0
0
-2
0
6
-2
-2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 9-10
2 2 2 2
1 1
2 2 3 3 2 2 3 3 3 3 3 3 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
10
6
12
2
2
12
6
10
12
10
14
0
0
-2
0
6
-2
-2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 10-11
2 2 2 2
1 1
2 2 3 3 2 2 3 3 3 3 3 3 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
10
6
12
2
2
12
6
10
12
10
14
0
0
-2
0
6
-2
-2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 11-12
2 2 2 2
1 1
2 2 3 3 2 2 3 3 3 3 3 3 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
10
6
13
2
2
12
6
10
12
10
14
0
0
-2
0
6
-2
-2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1 1 1
1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 12-13
2 2 2 2
1 1
2 2 3 3 2 2 3 3 3 3 3 3 1 1
0
1
2
3
4
5
Total Resource Load
Resource Available
A
B
C
D
E
F
G
2
2
2
1
1
1
1
2
6
4
2
2
4
2
0
6
2
10
6
12
2
2
12
6
10
12
10
14
0
0
-2
0
6
-2
-2
ID RES DUR ES LF TS 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
2 2
2 2
2 2 2 2
1 1
1 1 1 1
1 1
2 2 3 3 2 2 3 3 3 3 3 3 1 1
3 3 3 3 3 3 3 3 3 3 3 3 3 3
Resource Constrained Schedule Periode 13-14
2 2 2 2
1 1
0
1
2
3
4
5
131
Resource Constrained Schedule through Period 5-6
6 B 12
0 2 0
6 6 12
2 C 6
0 2 0
2 4 6
2 D 4
2 1 2
4 2 6
0 A 2
0 2 0
0 2 2
ES ID EF
SLK RES SLK
LS DUR LF
6 F 10
0 1 0
6 4 10
12 G 14
0 1 0
12 2 14
10 E 12
0 1 0
10 2 12
Legend
132
Original Network Plan
2 6 7
8 2A 8
10 5 15
2 4 5
4 2C 4
6 3 9
4 5 9
0 2C 0
4 5 9
0 2 3
6 1A 6
6 3 9 9 8 12
0 2B 0
9 3 12
14 10 16
1 2A 1
15 2 179 7 14
1 2B 1
10 5 15
0 1 2
4 1A 4
4 2 6
0 3 4
0 2B 0
0 4 4
4 9 7
5 2A 5
9 3 12
12 11 17
0 2C 0
12 5 17
ES ID EF
SLK RES SLK
LS DUR LF
Legend
Resources
available,
2 each of
A, B, C
Original Network Plan
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
S 0 6 S S S S S S
3 S 8 7
4 5 11 S S
10 2
1
15 16 17 18 19 20
A
B
C
Resource loading chart
ACT ES LS EF LF Slack
1 0 4 2 6 4
2 0 6 3 9 6
3 0 0 4 4 0
4 2 6 5 9 4
5 4 4 9 9 0
6 2 10 7 15 8
7 9 10 14 15 1
8 9 9 12 12 0
9 4 9 7 12 5
10 14 15 16 17 1
11 12 12 17 17 0
Plan schedule ACT RES ESR LSR EFR LFR Slack
1 1A 0 0 2 2 0
2 1A 0 7 3 10 7
3 2B 0 1 4 5 1
4 2C 2 2 5 5 0
5 2C 5 5 10 10 0
6 2A 7 13 12 18 6
7 2B 13 13 18 18 0
8 2B 10 10 13 13 0
9 2A 4 10 7 13 6
10 2A 18 18 20 20 0
11 2C 13 15 18 20 2
New resource schedule
134
Splitting/Multitasking
Activity duration without splitting
Activity duration split into three segments—A, B, C
Activity A Activity B Activity C
Activity A Activity B Activity C
Startup Shutdown
Activity duration split with shutdown and startup
Responsibility Matrix for a
Market Research Project
Task Richard Dan Dave Linda Elizabeth
Identify target customers R S S
Develop draft questionnaire R S S
Pilot-test questionnaire R S
Finalize questionnaire R S S S
Print questionnaire R
Prepare mailing labels R
Mail questionnaires R
Receive and monitor returned questionnaires R S
Input response data R
Analyze results R S S
Prepare draft of report S R S S
Prepare final report R S
Project team R = Responsible
S = Supports/assists
136
Responsibility Matrix for the Computer
Controlled Conveyor Belt Project
Deliverables
Design Develop-
ment
Documen-
tation
Assembly Testing Purchas-
ing
Quality
assurance
Manufac-
turing
Architechural design 1 2 2 3 3
Hardware specifications 2 1 2 3
Kernal specifications 1 3 3
Utilities specification 2 1 3
Hardware design 1 3 3 3
Disk drivers 3 1 2
Memory management 1 3 3
Operating system documentation 2 2 1 3
Prototypes 5 4 1 3 3 3 4
Integrated acceptance test 5 2 2 1 5 5
Organization
Legend
1 Responsible 2 Support
3 Consult 4 Notification
5 Approval
8–137
Direct Labor Budget
Rollup ($000)
FIGURE 8.12
8–138
Time-Phased Work Package Budget (Labor Cost Only)
FIGURE 8.13
8–139
Two Time-Phased Work Packages (Labor Cost Only)
FIGURE 8.14
8–140
Patient Entry Project Network
FIGURE 8.15
8–141
Patient Entry Time-Phased Work Packages Assigned
FIGURE 8.16
8–142
CEBOO Project Monthly Cash Flow Statement
FIGURE 8.17
8–143
CEBOO Project Weekly Resource Usage Schedule
FIGURE 8.18