0000000000617496
AUTHOR
Ariadna Fuertes
A heuristic to schedule flexible job-shop in a glass factory
We describe the design and implementation of a scheduling system in a glass factory. The factory produces a large variety of manufactured glass objects in a complex process ranging from melting the glass in the furnaces and blowing it automatically or manually to decorating, assembling and packing it. The structure basically corresponds to a flexible job-shop scheduling problem with some special characteristics. On the one hand, dealing with hot liquid glass imposes no-wait constraints on some operations. On the other hand, skilled workers performing some manual tasks are modelled as special machines. The system produces approximate solutions in very short computing times, trying to minimiz…
Game-based learning supported by audience response tools: game proposals and preliminary assessment
The so-called game-based learning strategies are based on introducing games in the classrooms to improve aspects such as student performance, concentration and effort. Currently, they provide a very useful resource to increase the motivation of university students, generating a better atmosphere among peers and between student and teacher, which in turn is generally translated into better academic results. However, the design of games that successfully achieve the desired teaching-learning objectives is not a trivial task. This work focuses on the design of games that allow the assessment of ICT-related university subjects. Specifically, three different games are proposed, all based on stud…
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
The Minimal Consistent Subset Selection (MCSS) problem is a discrete optimization problem whose resolution for large scale instances requires a prohibitive processing time. Prior algorithms addressing this problem are presented. Randomization and approximation techniques are suitable to face the problem, then random search and meta-heuristics are proposed and consequently Tabu Search strategies are applied and evaluated. Parallel computing helps to reduce processing time and/or produce better results; different approaches for designing parallel tabu search are analyzed.