2,753 research outputs found
A generic method for energy-efficient and energy-cost-effective production at the unit process level
Mixed integer programming and adaptive problem solver learned by landscape analysis for clinical laboratory scheduling
This paper attempts to derive a mathematical formulation for real-practice
clinical laboratory scheduling, and to present an adaptive problem solver by
leveraging landscape structures. After formulating scheduling of medical tests
as a distributed scheduling problem in heterogeneous, flexible job shop
environment, we establish a mixed integer programming model to minimize mean
test turnaround time. Preliminary landscape analysis sustains that these
clinics-orientated scheduling instances are difficult to solve. The search
difficulty motivates the design of an adaptive problem solver to reduce
repetitive algorithm-tuning work, but with a guaranteed convergence. Yet, under
a search strategy, relatedness from exploitation competence to landscape
topology is not transparent. Under strategies that impose different-magnitude
perturbations, we investigate changes in landscape structure and find that
disturbance amplitude, local-global optima connectivity, landscape's ruggedness
and plateau size fairly predict strategies' efficacy. Medium-size instances of
100 tasks are easier under smaller-perturbation strategies that lead to
smoother landscapes with smaller plateaus. For large-size instances of 200-500
tasks, extant strategies at hand, having either larger or smaller
perturbations, face more rugged landscapes with larger plateaus that impede
search. Our hypothesis that medium perturbations may generate smoother
landscapes with smaller plateaus drives our design of this new strategy and its
verification by experiments. Composite neighborhoods managed by meta-Lamarckian
learning show beyond average performance, implying reliability when prior
knowledge of landscape is unknown
HYBRID GENETIC AND PENGUIN SEARCH OPTIMIZATION ALGORITHM (GA-PSEOA) FOR EFFICIENT FLOW SHOP SCHEDULING SOLUTIONS
This paper presents a novel hybrid approach, fusing genetic algorithms (GA) and penguin search optimization (PSeOA), to address the flow shop scheduling problem (FSSP). GA utilizes selection, crossover, and mutation inspired by natural selection, while PSeOA emulates penguin foraging behavior for efficient exploration. The approach integrates GA's genetic diversity and solution space exploration with PSeOA's rapid convergence, further improved with FSSP-specific modifications. Extensive experiments validate its efficacy, outperforming pure GA, PSeOA, and other metaheuristics
Fast Scheduling of Robot Teams Performing Tasks With Temporospatial Constraints
The application of robotics to traditionally manual manufacturing processes requires careful coordination between human and robotic agents in order to support safe and efficient coordinated work. Tasks must be allocated to agents and sequenced according to temporal and spatial constraints. Also, systems must be capable of responding on-the-fly to disturbances and people working in close physical proximity to robots. In this paper, we present a centralized algorithm, named 'Tercio,' that handles tightly intercoupled temporal and spatial constraints. Our key innovation is a fast, satisficing multi-agent task sequencer inspired by real-time processor scheduling techniques and adapted to leverage a hierarchical problem structure. We use this sequencer in conjunction with a mixed-integer linear program solver and empirically demonstrate the ability to generate near-optimal schedules for real-world problems an order of magnitude larger than those reported in prior art. Finally, we demonstrate the use of our algorithm in a multirobot hardware testbed
Allocation des ressources dans les environnements informatiques en périphérie des réseaux mobiles
Abstract: The evolution of information technology is increasing the diversity of connected devices and leading to the expansion of new application areas. These applications require ultra-low latency, which cannot be achieved by legacy cloud infrastructures given their distance from users. By placing resources closer to users, the recently developed edge computing paradigm aims to meet the needs of these applications. Edge computing is inspired by cloud computing and extends it to the edge of the network, in proximity to where the data is generated. This paradigm leverages the proximity between the processing infrastructure and the users to ensure ultra-low latency and high data throughput. The aim of this thesis is to improve resource allocation at the network edge to provide an improved quality of service and experience for low-latency applications. For better resource allocation, it is necessary to have reliable knowledge about the resources available at any moment. The first contribution of this thesis is to propose a resource representation to allow the supervisory xentity to acquire information about the resources available to each device. This information is then used by the resource allocation scheme to allocate resources appropriately for the different services. The resource allocation scheme is based on Lyapunov optimization, and it is executed only when resource allocation is required, which reduces the latency and resource consumption on each edge device. The second contribution of this thesis focuses on resource allocation for edge services. The services are created by chaining a set of virtual network functions. Resource allocation for services consists of finding an adequate placement for, routing, and scheduling these virtual network functions. We propose a solution based on game theory and machine learning to find a suitable location and routing for as well as an appropriate scheduling of these functions at the network edge. Finding the location and routing of network functions is formulated as a mean field game solved by iterative Ishikawa-Mann learning. In addition, the scheduling of the network functions on the different edge nodes is formulated as a matching set, which is solved using an improved version of the deferred acceleration algorithm we propose. The third contribution of this thesis is the resource allocation for vehicular services at the edge of the network. In this contribution, the services are migrated and moved to the different infrastructures at the edge to ensure service continuity. Vehicular services are particularly delay sensitive and related mainly to road safety and security. Therefore, the migration of vehicular services is a complex operation. We propose an approach based on deep reinforcement learning to proactively migrate the different services while ensuring their continuity under high mobility constraints.L'évolution des technologies de l'information entraîne la prolifération des dispositifs connectés qui mène à l'exploration de nouveaux champs d'application. Ces applications demandent une latence ultra-faible, qui ne peut être atteinte par les infrastructures en nuage traditionnelles étant donné la distance qui les sépare des utilisateurs. En rapprochant les ressources aux utilisateurs, le paradigme de l'informatique en périphérie, récemment apparu, vise à répondre aux besoins de ces applications. L’informatique en périphérie s'inspire de l’informatique en nuage, en l'étendant à la périphérie du réseau, à proximité de l'endroit où les données sont générées. Ce paradigme tire parti de la proximité entre l'infrastructure de traitement et les utilisateurs pour garantir une latence ultra-faible et un débit élevé des données. L'objectif de cette thèse est l'amélioration de l'allocation des ressources à la périphérie du réseau pour offrir une meilleure qualité de service et expérience pour les applications à faible latence. Pour une meilleure allocation des ressources, il est nécessaire d'avoir une bonne connaissance sur les ressources disponibles à tout moment. La première contribution de cette thèse consiste en la proposition d'une représentation des ressources pour permettre à l'entité de supervision d'acquérir des informations sur les ressources disponibles à chaque dispositif. Ces informations sont ensuite exploitées par le schéma d'allocation des ressources afin d'allouer les ressources de manière appropriée pour les différents services. Le schéma d'allocation des ressources est basé sur l'optimisation de Lyapunov, et il n'est exécuté que lorsque l'allocation des ressources est requise, ce qui réduit la latence et la consommation en ressources sur chaque équipement de périphérie. La deuxième contribution de cette thèse porte sur l'allocation des ressources pour les services en périphérie. Les services sont composés par le chaînage d'un ensemble de fonctions réseau virtuelles. L'allocation des ressources pour les services consiste en la recherche d'un placement, d'un routage et d'un ordonnancement adéquat de ces fonctions réseau virtuelles. Nous proposons une solution basée sur la théorie des jeux et sur l'apprentissage automatique pour trouver un emplacement et routage convenable ainsi qu'un ordonnancement approprié de ces fonctions en périphérie du réseau. La troisième contribution de cette thèse consiste en l'allocation des ressources pour les services véhiculaires en périphérie du réseau. Dans cette contribution, les services sont migrés et déplacés sur les différentes infrastructures en périphérie pour assurer la continuité des services. Les services véhiculaires sont en particulier sensibles à la latence et liés principalement à la sûreté et à la sécurité routière. En conséquence, la migration des services véhiculaires constitue une opération complexe. Nous proposons une approche basée sur l'apprentissage par renforcement profond pour migrer de manière proactive les différents services tout en assurant leur continuité sous les contraintes de mobilité élevée
Modularization in material flow simulation for managing production releases in remanufacturing
Remanufacturing is recognized as a major circular economy option to recover and upgrade functions from post-use products. However, the inefficiencies associated with operations, mainly due to the uncertainty and variability of material flows and product conditions, undermine the growth of remanufacturing. With the objective of supporting the design and management of more proficient and robust remanufacturing processes, this paper proposes a generic and reconfigurable simulation model of remanufacturing systems. The developed model relies upon a modular framework that enables the user to handle multiple process settings and production control policies, among which token-based policies. Customizable to the characteristics of the process under analysis, this model can support logistics performance evaluation of different production control policies, thus enabling the selection of the optimal policy in specific business contexts. The proposed model is applied to a real remanufacturing environment in order to validate and demonstrate its applicability and benefits in the industrial settings
- …