Batch-scheduling problems through the flowshop with both receiving and delivery just in time

In scheduling literature, the flowshop problem is usually concerned only with finding a processing order of jobs on each machine. However, this paper addresses flowshop batch-scheduling problems, that is, to determine batch sizes of parts with a common due date, and to schedule the resulting batches. We propose an objective for the problems that not only minimizes inventory but also provides for receiving material just in time and delivery just in time. A heuristic method to solve the problem is proposed. An example is also provided to show how the proposed method works.