Multi-manned assembly line,which is broadly utilized to assemble high volume products such as automobiles and trucks,allows a group of workers to assemble different tasks simultaneously in a multi-manned workstation.T...Multi-manned assembly line,which is broadly utilized to assemble high volume products such as automobiles and trucks,allows a group of workers to assemble different tasks simultaneously in a multi-manned workstation.This additional characteristic of parallel operators increases the complexity of the traditional NP-hard assembly line balancing problem.Hence,this paper formulates the Type-I multi-manned assembly line balancing problem to minimize the total number of workstations and operators,and develops an efficient migrating birds optimization algorithm embedded into an idle time reduction method.In this algorithm,a new decoding mechanism is proposed which reduces the sequence-dependent idle time by some task assignment rules;three effective neighborhoods are developed to make refinement of existing solutions in the bird improvement phases;and temperature acceptance and competitive mechanism are employed to avoid being trapped in the local optimum.Comparison experiments suggest that the new decoding and improvements are effective and the proposed algorithm outperforms the compared algorithms.展开更多
FSSP is a typical NP-Hard problem which is desired to be minimum makespan. This study consid- ers Migrating Birds Optimization (MBO) which is metaheuristic approach for the solution of Flow Shop Sequencing Problem (FS...FSSP is a typical NP-Hard problem which is desired to be minimum makespan. This study consid- ers Migrating Birds Optimization (MBO) which is metaheuristic approach for the solution of Flow Shop Sequencing Problem (FSSP). As the basic MBO algorithm is designed for discrete problems. The performance of basic MBO algorithm is tested via some FSSP data sets exist in literature. Obtained results are compared with optimal results of related data sets.展开更多
基金supported by the National Natural Science Foundation of China(51875421,61803287).
文摘Multi-manned assembly line,which is broadly utilized to assemble high volume products such as automobiles and trucks,allows a group of workers to assemble different tasks simultaneously in a multi-manned workstation.This additional characteristic of parallel operators increases the complexity of the traditional NP-hard assembly line balancing problem.Hence,this paper formulates the Type-I multi-manned assembly line balancing problem to minimize the total number of workstations and operators,and develops an efficient migrating birds optimization algorithm embedded into an idle time reduction method.In this algorithm,a new decoding mechanism is proposed which reduces the sequence-dependent idle time by some task assignment rules;three effective neighborhoods are developed to make refinement of existing solutions in the bird improvement phases;and temperature acceptance and competitive mechanism are employed to avoid being trapped in the local optimum.Comparison experiments suggest that the new decoding and improvements are effective and the proposed algorithm outperforms the compared algorithms.
基金supported by Scientific Research Project of Necmettin Erbakan University
文摘FSSP is a typical NP-Hard problem which is desired to be minimum makespan. This study consid- ers Migrating Birds Optimization (MBO) which is metaheuristic approach for the solution of Flow Shop Sequencing Problem (FSSP). As the basic MBO algorithm is designed for discrete problems. The performance of basic MBO algorithm is tested via some FSSP data sets exist in literature. Obtained results are compared with optimal results of related data sets.
