Aiming at the inefficiency caused by an unbalanced workstation load in the mixed-model assembly line (MMAL), we study the assembly line (AL) design and load balancing problem under parallel tasks. Considering the task configuration cost, workstation opening cost and penalty cost of unbalanced load on the assembly line, a mixed integer programming model with the workstation’s space capacity constraint is established to formulate the mixed-model assembly line load balancing problem (MMALLBP), which is aiming at minimizing the total cost. In addition, the simulated annealing algorithm with an improvement strategy is proposed. Numerical experiments using the improved simulated annealing algorithm are superior to the solver in terms of solving time and stability, and the solving accuracy is higher than that of the traditional simulated annealing algorithm. Allowing parallel tasks can flexibly allocate tasks to the workstations, effectively use the idle time of the workstations, reduce the number of opened workstations, improve the production efficiency, reduce construction costs and the risk caused by the unbalanced load of AL.

In this paper, we present a new Imperialist Competitive Algorithm (ICA) to solve a bi-objective unrelated parallel machine scheduling problem where setup times are sequence dependent. The objectives include mean completion time of jobs and mean squares of deviations from machines workload from their averages. The performance of the proposed ICA (PICA) method is examined using some randomly generated data and they are compared with three alternative methods including particle swarm optimization (PSO), original version of imperialist competitive algorithm (OICA) and genetic algorithm (GA) in terms of the objective function values. The preliminary results indicate that the proposed study outperforms other alternative methods. In addition, while OICA performs the worst as alternative solution strategy, PSO and GA seem to perform better.

Today, the world facing with huge flood of data and the recent advances in computer technology have provided the capability to process significant amount of data. On the other hand, analyzing the information requires resources that most institutions do not have, independently. To handle such circumstances, grid computing has emerged as an important research area where the calculation of distributed computing and clustering are different. In this study, we propose a grid computing architecture as a set of protocols that use the cumulative knowledge of computers, networks, databases and scientific instruments based on the implementation of Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) technique. The results of the implementation of the proposed algorithm on grid systems indicate the superiority of the proposed approach in terms of validation criteria scheduling algorithms, such as task completion time and the performance compared with some alternative method.