Solving the Cubic Cell Formation Problem Using Simulated Annealing

The Cubic Cell Formation Problem (CCFP) in cellular manufacturing systems consists in decomposing a production system into a set of manufacturing cells, and assigning workers to cells besides parts and machines. The major objective is to obtain manageable cells. Manageable cells mean cells with a minimum value of inter-cell moves of parts and workers and a minimum value of heterogeneity within cells. In this paper, a solution methodology based on a modified simulated annealing heuristic with a proposed neighbourhood search procedure is proposed. The methodology allows building multiple configurations by giving to the decision-maker the ability to control some parameters. Experimental results show that the proposed algorithm gives a promising performance for all problem instances found in the literature.

A Decision Support System for Multiple Team Formation

This work presents a Decision Support System to assist multiple team formation in the context of software development. After analysis of recent works in the literature, it was found that the approaches are still unable to reflect the real needs of the industry, which makes their practical application difficult. Our findings confirm the benefits of our prototype developed to researchers who are interested in comprehending the team formation problem and industry practitioners who may be interested in understanding how Decision Support Systems can support the teams formation.

The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession

The traditional machine-part cell formation problem simultaneously clusters machines and parts in different production cells from a zero–one incidence matrix that describes the existing interactions between the elements. This manuscript explores a novel alternative for the well-known machine-part cell formation problem in which the incidence matrix is composed of non-binary values. The model is presented as multiple-ratio fractional programming with binary variables in quadratic terms. A simple reformulation is also implemented in the manuscript to express the model as a mixed-integer linear programming optimization problem. The performance of the proposed model is shown through two types of empirical experiments. In the first group of experiments, the model is tested with a set of randomized matrices, and its performance is compared to the one obtained with a standard greedy algorithm. These experiments showed that the proposed model achieves higher fitness values in all matrices considered than the greedy algorithm. In the second type of experiment, the optimization model is evaluated with a real-world problem belonging to Human Resource Management. The results obtained were in line with previous findings described in the literature about the case study.

Lateral Degassing Method for Disposable Film-Chip Microfluidic Devices

It is critical to develop a fast and simple method to remove air bubbles inside microchannels for automated, reliable, and reproducible microfluidic devices. As an active degassing method, this study introduces a lateral degassing method that can be easily implemented in disposable film-chip microfluidic devices. This method uses a disposable film-chip microchannel superstrate and a reusable substrate, which can be assembled and disassembled simply by vacuum pressure. The disposable microchannel superstrate is readily fabricated by bonding a microstructured polydimethylsiloxane replica and a silicone-coated release polymeric thin film. The reusable substrate can be a plate that has no function or is equipped with the ability to actively manipulate and sense substances in the microchannel by an elaborately patterned energy field. The degassing rate of the lateral degassing method and the maximum available pressure in the microchannel equipped with lateral degassing were evaluated. The usefulness of this method was demonstrated using complex structured microfluidic devices, such as a meandering microchannel, a microvortex, a gradient micromixer, and a herringbone micromixer, which often suffer from bubble formation. In conclusion, as an easy-to-implement and easy-to-use technique, the lateral degassing method will be a key technique to address the bubble formation problem of microfluidic devices.

k-Circle Formation and k-epf by Asynchronous Robots

For a given positive integer k, the k-circle formation problem asks a set of autonomous, asynchronous robots to form disjoint circles having k robots each at distinct locations, centered at a set of fixed points in the Euclidean plane. The robots are identical, anonymous, oblivious, and they operate in Look–Compute–Move cycles. This paper studies the k-circle formation problem and its relationship with the k-epf problem, a generalized version of the embedded pattern formation problem, which asks exactly k robots to reach and remain at each fixed point. First, the k-circle formation problem is studied in a setting where the robots have an agreement on the common direction and orientation of one of the axes. We have characterized all the configurations and the values of k, for which the k-circle formation problem is deterministically unsolvable in this setting. For the remaining configurations and the values of k, a deterministic distributed algorithm has been proposed, in order to solve the problem. It has been proved that for the initial configurations with distinct robot positions, if the k-circle formation problem is deterministically solvable then the k-epf problem is also deterministically solvable. It has been shown that by modifying the proposed algorithm, the k-epf problem can be solved deterministically.