The blocking job shop problem (BJSSP) is a variant of the classical job shop problem, where a job completed on one machine cannot be transferred to the next machine until the latter becomes available, causing the current machine to remain blocked. Many real-world problems have been modeled as BJSSP. This problem is classified as strongly NP-hard. The existing literature indicates that some proposed methods fail to guarantee the generation of feasible solutions during the search process, necessitating solution reconstruction. In this study, we developed an Estimation Distribution Algorithm (EDA) designed to operate strictly within the BJSSP feasible solution space. The experiments showed that no specific levels of the factors were found to be significant in determining the quality of the solutions found by the EDA across all problem sets. On the other hand, incorporating assignment probabilities into the construction of EDA solutions facilitated diversity among the generated solutions. The runtime of the EDA for the proposed problem sets in the experiments, using the factor levels defined, ranged from 20 s for problems with 10 jobs and 5 machines to 600 s for those with 30 jobs and 10 machines. The proposed EDA begins by generating a random initial population of solutions. The makespan (Cmax) is then computed for each individual. The next generation is composed by three sets of individuals. The first group corresponds to a percentage of the best-performing individuals of the current generation. The second group is generated by using a probability distribution function derived from the structure of the selected solutions, while the remaining individuals are created randomly to enhance the algorithm’s exploratory capability. Our results demonstrate that the proposed method improves upon some of the previously best-known results in the current state of the art.
The Blocking Job Shop Scheduling Problem (BJSSP) is a variant of the classical Job Shop Scheduling Problem in which a job completed on one machine cannot be transferred to the next machine until the latter becomes available, causing the current machine to remain blocked. Numerous real-world applications have been modeled as the BJSSP, which is classified as a strongly NP-hard problem. Previous studies indicate that several proposed approaches fail to guarantee the generation of feasible solutions during the search process, thereby requiring a solution reconstruction. In this study, we propose a Genetic Algorithm (GA) designed to operate strictly within the feasible solution space of the BJSSP, where the objective function is the minimization of the makespan. Experimental results show that no specific factor levels significantly influenced the solution quality obtained by the GA across all problem sets. On the other hand, incorporating an assignment operator into the solution representation enhanced the diversity of the population. The proposed GA yields solutions that outperform some of the best-known makespan values for the Lawrence benchmark problems. The runtime of the GA ranged from 20 s for instances with 10 jobs and five machines to 600 s for instances with 30 jobs and 10 machines.
La gestión de datos en estudios clínicos de cohorte representa grandes retos en custodia y suministro periódico de información por parte de participantes. Por ejemplo, la información captada de mujeres gestantes en Antioquia supone un desafío asociado con limitaciones de comunicación entre regiones, pero también una oportunidad para acceder a datos y comunicación en tiempo real entre paciente - investigador, lo que apoyaría la salud preventiva. Así, el desarrollo de una aplicación móvil usando Dart y Flutter para la interfaz y Python con Flask para el backend, se orienta al monitoreo de síntomas y la captación de información gestacional, como insumo durante los controles prenatales en especialidades gineco-obstetricas en el futuro. El desarrollo, aplicó principios de Scrum integrando contenidos científicos como autenticación segura, registro de síntomas, historial y notificaciones. En conclusión, la aplicación denominada GESTANTEAPP, permitirá el seguimiento del bienestar materno-fetal en Antioquia basado en principios de telemedicina. Data management in research projects about cohort study represents significant challenges due to the custody and the difficulties in periodic data of information from participants. Thereby, the collected information from pregnant women in the department of Antioquia is a challenge due to limitations of communication across regions, but also an opportunity to access real-time data, support preventive health, and link the continuous contact between researchers and patients. This research paper shows the development of a mobile application built with Dart and Flutter for the interface and Python with Flask for the backend, aimed at monitoring symptoms and capturing information during pregnancy. The development applied Scrum principles and incorporated scientific content validated by gynecologist and experts. The results include secure authentication, symptom logging, history visualization, and notifications. It is concluded that GESTANTEAPP will allow the continuous monitoring and strengthens maternal–fetal well-being in different regions located in Antioquia based on telemedicine principles.