Application of genetic approach for advanced planning in multi-factory environment

TY - JOUR

T1 - Application of genetic approach for advanced planning in multi-factory environment

AU - Chung, S.H.

AU - Lau, H.C.W.

AU - Choy, K.L.

AU - Ho, G.T.S.

AU - Tse, Y.K.

PY - 2010/10

Y1 - 2010/10

N2 - This paper deals with multi-factory production scheduling problems which consist of a number of factories. Each factory consists of various machines and is capable of performing various operations. Some factories may produce intermediate products and supply to other factories for assembly purpose, while some factories may produce finished products and supply to end customers. The model is subject to capacity constraints, precedence relationship, and alternative machining with different processing time. The problem encountered is to determine how to cope with each factory and machine in the system, and the objective is to minimize the makespan of a set of given jobs through proper collaboration. The makespan takes into account the processing time, transportation time between resources, and machine set-up time. This paperproposes a modified genetic algorithm to deal with the problem. The optimization reliability of the proposed algorithm has been tested by comparing it with existing approaches and simple genetic algorithms in several numerical examples found in literatures. The influence of different crossover and mutation rates on the performance of genetic search in simple genetic algorithms has also been demonstrated. The results also show the robustness of the proposed algorithm in this problem.

AB - This paper deals with multi-factory production scheduling problems which consist of a number of factories. Each factory consists of various machines and is capable of performing various operations. Some factories may produce intermediate products and supply to other factories for assembly purpose, while some factories may produce finished products and supply to end customers. The model is subject to capacity constraints, precedence relationship, and alternative machining with different processing time. The problem encountered is to determine how to cope with each factory and machine in the system, and the objective is to minimize the makespan of a set of given jobs through proper collaboration. The makespan takes into account the processing time, transportation time between resources, and machine set-up time. This paperproposes a modified genetic algorithm to deal with the problem. The optimization reliability of the proposed algorithm has been tested by comparing it with existing approaches and simple genetic algorithms in several numerical examples found in literatures. The influence of different crossover and mutation rates on the performance of genetic search in simple genetic algorithms has also been demonstrated. The results also show the robustness of the proposed algorithm in this problem.

UR - http://www.scopus.com/inward/record.url?scp=77956056614&partnerID=8YFLogxK

M3 - Article

SN - 0925-5273

VL - 127

SP - 300

JO - International Journal of Production Economics

JF - International Journal of Production Economics

IS - 2

ER -