Which technique is used for making cost and schedule trade$-$offs to obtain the greatest amount of schedule compression for the least incremental cost?

a$.$ crashing

b$.$ critical chain scheduling

c$.$ dependency

d$.$ feeding buffers