Determine the Optimal Sequence-Dependent Completion Times for Multiple Demand with Multi-Products Using Genetic Algorithm

Abstract

Sequencing is the most impact factor on the total completion time , the products sequences inside demands that consist from muti-product and for multiple demands . It is very important in assembly line and batch production .

The most important drawback of existing methods used to solve the sequencing problems is the sequence must has a few products and dependent completion time for single demand . In this paper we used genetic algorithm –based Travelling Salesman Problem with Precedence Constraints Approach ( TSPPCA)  to minimize completion time . The main advantage of this new method , it is used to solve the sequencing problems for multiple demand with multi-product

In this paper , we compare between modify the assignment method ( MAM ) and genetic algorithm  depend on least completion time , the results discern that   GA  has minimum completion time

Keywords: products sequences , completion time , travel salesman problem (TSP ) , TSPPCA , genetic algorithm.  .