In this research, we examine an integrated lot-streaming and just-in-time scheduling problem with a common due date. We address scheduling customer orders in batches of limited size in production systems with single or identical parallel machines. The objective is to find a feasible schedule to meet the requirements, which satisfies the batch size constraints and minimizes the sum of tardiness and earliness penalties and setup costs, which involves the cost of creating a new batch. We present some structural properties of an optimal solution and analyze some polynomial cases and propose solution algorithms.