this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...