A genetic algorithm-based approach to machine assignment problem

Chan, F.T.S. and Wong, T.C. and Chan, L.Y. (2005) A genetic algorithm-based approach to machine assignment problem. International Journal of Production Research, 43 (12). pp. 2451-2472. ISSN 0020-7543 (https://doi.org/10.1080/00207540500045956)

Full text not available in this repository.Request a copy

Abstract

Over the last few decades, production scheduling problems have received much attention. Due to global competition, it is important to have a vigorous control on production costs while keeping a reasonable level of production capability and customer satisfaction. One of the most important factors that continuously impacts on production performance is machining flexibility, which can reduce the overall production lead-time, work-in-progress inventories, overall job lateness, etc. It is also vital to balance various quantitative aspects of this flexibility which is commonly regarded as a major strategic objective of many firms. However, this aspect has not been studied in a practical way related to the present manufacturing environment. In this paper, an assignment and scheduling model is developed to study the impact of machining flexibility on production issues such as job lateness and machine utilisation. A genetic algorithm-based approach is developed to solve a generic machine assignment problem using standard benchmark problems and real industrial problems in China. Computational results suggest that machining flexibility can improve the overall production performance if the equilibrium state can be quantified between scheduling performance and capital investment. Then production planners can determine the investment plan in order to achieve a desired level of scheduling performance.

ORCID iDs

Chan, F.T.S., Wong, T.C. ORCID logoORCID: https://orcid.org/0000-0001-8942-1984 and Chan, L.Y.;
CORE (COnnecting REpositories)