This research has developed a batch scheduling for fabrication and assembly scheduling in a dynamic
flow shop with 4-machine processing multiple items with multiple due dates to minimize the total actual flow
time. Each item comprises one unit of a common component and a number of multiple unique-components each
of which consists of one unit. A common component is a similar component for all items and a unique
component is a specific component for each item. The fabrication process of both components is conducted on
the first three machines and the assembly process is conducted on the fourth machine. The common components
and the unique components are fabricated in batches for the same unique component, and the assembly process
is also performed in batches for the same items. The dynamic condition in this model means that new orders
may arrive at any time over the planning horizon. The new order arrivals are accommodated by totally
rescheduling the initial schedule. The proposed algorithm consists of two algorithms: (1) the static algorithm
determining the number of batches, batch sizes and the schedule, and (2) the dynamic algorithm dealing with
arrivals of the new jobs. Numerical experiments show that the proposed algorithm is appropriate to solve such
problems.