The greedy algorithm for partially ordered sets

Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works.