We describe a planning problem at a broadcasting company (e.g. a TV or radio channel). Advertisers place orders for commercials. Typically, each order consists of multiple spots, and the airdates of the spots are not fixed by the advertiser. Therefore, the channel has to decide simultaneously which orders to accept or to reject and when spots from accepted orders should be scheduled. We formally describe this problem in a mathematical model, present five heuristics, develop a rigorous method to generate a test bed and evaluate the performance of the heuristics on over 10,000 instances of various sizes.