Learn More
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, minimizing the cycle time for the minimum number of workstations. In order to solve the problem we propose the use of a Greedy Randomized Adaptive Search Procedure (GRASP) obtained(More)
The cryopreservation of mammalian embryos has become an integral part of methods to control animal reproduction. Numerous vitrification solutions have been formulated with ethylene glycol in combination with macromolecules, sugars and other cryoprotective agents. These indicate that a study of ethylene glycol as a cryoprotectant of choice in vitrification(More)
This paper deals with the assembly line balancing problem with incompatibilities between tasks with two hierarchical objectives: minimising the number of stations, and once these are fixed, minimising the cycle time. It is solved through CPLEX optimiser software, in which we have introduced a bounding procedure and an exploration strategy based on greedy(More)
The present article focuses on the application of a procedure based on ant colonies to solve an assembly line balancing problem. After an introduction to assembly line problems, the problem under study is presented: the Time and Space constrained Assembly Line Balancing Problem (TSALBP); and a basic model of one of its variants is put forward for study.(More)
This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly(More)
Time and space assembly line balancing considers realistic multi-objective versions of the classical assembly line balancing industrial problems. It involves the joint optimisation of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The different problems included in this area also inherit the(More)
– The set covering problem (SCP) is a well-known combinatorial optimization problem. We present a GRASP algorithm to Unicost Set Covering Problem, a special case of the Set Covering Problem where no distinction is made between covering sets. The most significant contribution of the algorithm is the incorporation of a local improvement procedure based on the(More)
Keywords: Time and space assembly line balancing problem Ant colony optimisation GRASP Multiobjective optimisation NSGA-II Automotive industry a b s t r a c t In this work we present two new multiobjective proposals based on ant colony optimisa-tion and random greedy search algorithms to solve a more realistic extension of a classical industrial problem:(More)
Ovulated mouse oocytes denuded of their cumulus cells, were vitrified in a solution containing 7 M ethylene glycol as the sole cryoprotectant using one or two steps of exposure before vitrification and were diluted in 1 M sucrose solution in 5 or 10 min after warming. The results proved that the viability of oocytes are detrimentally affected by exposure to(More)