  Upper bounds to the size of a family of subsets of an n-element set that
avoids certain configurations are proved. These forbidden configurations can be
described by inclusion patterns and some sets having the same size. Our results
are closely related to the forbidden subposet problems, where the avoided
configurations are described solely by inclusions.
