摘要：Many firms have to deal with the problems of scheduling and transportation allocation. The problems of assembly scheduling mainly focus on how to arrange orders in proper sequence on the assembly line with the purpose of minimizing the maximum completion time before they are flown to their destinations. Transportation allocation problems arise in how to assign processed orders to transport modes in order to minimize penalties such as earliness and tardiness. The two problems are usually separately discussed due to their complexity. This paper simultaneously deals with these two problems for firms with multiple identical parallel machines. We formulate this problem as a mixed integer programming model. The problem belongs to the class of NP-complete combinatorial optimization problems. This paper develops a hybrid genetic algorithm to obtain a compromised solution within a reasonable CPU time. We evaluate the performance of the presented heuristic with the well-known GAMS/CPLEX software. The presented approach is shown to perform well compared with well-known commercial software.
