Sharif Digital Repository

Minimizing completion time of tasks in a flowshops has always attracted attention of researchers since it was introduced by Johnson, 1954. If all jobs are processed in the same order, the sequence is called a permutation sequence. Tardiness factor is one of important factors in permutation flowshop sequencing problem. Minimizing this factor brings about increase in service level of the shop and is helpful in meeting customer’s needs. Since, minimizing tardiness in PFSP in among NP-hard problems, computational efforts in this area has focused on heuristic approaches. However, the researches has always considered due dates only on the last machine. It means, always it has been assumed that due...