This paper presents a hierarchical genetic algorithm (GA) to solve the cell formation and layout decisions of cellular manufacturing. The intrinsic features of our proposed GA include using a hierarchical chromosome structure to encode concurrent cell design and layout decisions, developing a new selection scheme to dynamically considering two highly correlated fitness functions, and proposing ...

The line-cell (or line-seru) conversion is an innovation of assembly system applied widely in the electronics industry. Its essence is tearing out an assembly line and adopting a mini-assembly unit, called seru (or Japanese style assembly cell). In this paper, we develop a multi-objective optimization model to investigate two line-cell conversion performances: the total throughput time (TTPT) a...

The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous minimization of the numbers of exceptions and voids, and minimization of intercell moves and within-cell...

This paper studies scheduling algorithms and evaluates the performance of high-speed switching systems. A novel architecture for three-dimensional Virtual Output Queue (3DVOQ) switches is proposed with a suitable scheduling algorithm to improve the competitive transfer of service. This 3D-VOQ switch, which exactly emulates an output-queued switch with a broad class of service scheduling algorit...

The dynamic channel assignment (DCA) in mobile communications systems using genetic algorithm (GA) is investigated in this research. Two new strategies using GA are proposed. In the first one, the channels previously assigned are kept locked during the call holding time (GAL). In the second one, the calls can be switched to different channels during the connection time (GAS). The performance of...

In this paper, we introduce a human–robot collaboration (HRC) mold assembly cell to cope with small-volume production and reduce the risk of musculoskeletal disorders (MSDs) on human worker during manual operation. Besides, wide variety types weights components motivated us design an HRC system that consists two robots. Therefore, propose modes for systems using robots develop task-allocation m...

In this chapter experience with solving quadratic assignment problems is reported. The results reported in this chapter are the best results for heuristic solutions of the quadratic assignment problem available to date and can serve as bench mark results for future researchers who propose new approaches for solving quadratic assignment problems. The most effective method to date for solving qua...

Quadratic Assignment Problem (QAP) is an NPhard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime effici...

Virtual machine (VM) replication is a critical task in any cloud computing platform to ensure the availability of service for end user. In this task, one primary VM resides on physical (PM) and or more replicas reside separate PMs. computing, placement (VMP) well-studied problem terms different goals, such as power consumption reduction. The VMP can be solved by using heuristics, namely, first-...