How does Fibonacci heap delay work as long as possible?

I am reading CLRS and came across a line "Fibonacci heaps delay works as long as possible".But what does it actually mean by delaying works and how can that be related to performance.

I think he explained very clearly in the book. You should notice that when an element is added to the heap, there is no work done O(1) , the new element is just simply attached to the root, and the heap is only reorganized until an element is removed.( Look at the exactMin function). And that's why he means all the work is delayed as long as possible