We treat the problem of scheduling a owshop with pallet requirements. Each job in the owshop needs a pallet the entire time, from the start of its rst operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by an integer K. We prove that the problem is NP-hard in the strong sense for m 2 and K 3, and for m 3 and K 2, where m is th...