Packing density of sets with only two non-mixed gaps

For a finite set of integers such that the first few gaps between its consecutive elements equal a, while the remaining gaps equal b, we study dense packings of its translates on the line. We obtain an explicit lower bound on the corresponding optimal density, conjecture its tightness, and prove it in case one of the gap lengths, a or b, appears only once. This is equivalent to a Motzkin problem on the independence ratio of certain integer distance graphs.