construct-greedy

Dur. duration
Expd. expected
A.C cost
C.C cost

data

• kapan mulai aktivitas
• perlu proses
  • daily reward
  • cost fix
  • start time
  • finish time
  • x deadline: tgl mulai aktivitas + duration
  • x predecessor

problem

• tujuan: berapa minimal tim dalam constraint

algoritme

• greedy
• feasible condition
  • is activity compatible with some team
  • x predecessor list ?
• constraint
  • 1 tahun
  • kurun waktu 6 bulan

meminimumkan cost reward, penalty

laporan