Resource aggregation issues and effects in mixed model assembly

In this paper we consider the problem of grouping machine and human resources in mixed model assembly process so that sequencing and scheduling decisions may be performed more efficiently. Resource aggregation can potentially and significantly improve production efficiency and throughput by balancing production rates, and by minimising resource deficiencies and idle time inefficiencies. This resource aggregation problem in particular involves determining how many groups to have and what number of machines and workers should be assigned to each. Not only is the number important in the aggregation but also the type (identity). Hence which specific machines and workers should be assigned to each group must also be answered. There are numerous factors that affect the aggregation. For example worker experience level and preferences, job processing requirements, current and future jobs and workloads, travelling distances and adjacency conditions. Very little theory however exists to indicate what a good resource aggregation is. Few if any experimental results exist to indicate what level of improvement is also possible. In this paper we therefore provide a mathematical framework for answering these questions that includes an analysis of the complexity of the problem. A general mathematical model is formulated that is suitable for any machine scheduling environment and for any combination of distinct and indistinct resources. A number of alternative measures of performance may be used as the objective function for this model. These include workload and experience balancing and minimal travelling time and distance objectives, although the choice of objective is very much dependant on the particular process being addressed. However, due to the complexity of the problem, significant numerical investigations are left as a source of continuing research.

[1]  Ralph P. Grimaldi,et al.  Discrete and Combinatorial Mathematics: An Applied Introduction , 1998 .

[2]  Joseph B. Mazzola,et al.  Flow Shop Scheduling with Resource Flexibility , 1994, Oper. Res..

[3]  Gregory Levitin,et al.  Genetic algorithm for assembly line balancing , 1995 .

[4]  Erhan Kozan,et al.  Sequencing and scheduling in flowshops with task redistribution , 2001, J. Oper. Res. Soc..

[5]  Robert L. Burdett,et al.  Evolutionary algorithms for flowshop sequencing with non‐unique jobs , 2000 .

[6]  Erhan Kozan,et al.  Evolutionary Algorithms For Resource Constrained Non-Serial Mixed Flow Shops , 2003, Int. J. Comput. Intell. Appl..

[7]  Abraham Kandel,et al.  Discrete Mathematics for Computer Scientists and Mathematicians , 1986 .

[8]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[10]  Erhan Kozan,et al.  The Assignment of Individual Renewable Resources in Scheduling , 2004, Asia Pac. J. Oper. Res..

[11]  Abraham Kandel,et al.  Discrete mathematics for computer scientists , 1983 .

[12]  Nick T. Thomopoulos,et al.  Mixed Model Line Balancing with Smoothed Station Assignments , 1970 .

[13]  C Merengo,et al.  Balancing and sequencing manual mixed-model assembly lines , 1999 .

[14]  Erhan Kozan,et al.  Sequencing and scheduling for non serial permutation flowshops , 2002 .

[15]  Chris N. Potts,et al.  Workload balancing and loop layout in the design of a flexible manufacturing system , 2001, Eur. J. Oper. Res..