Self-managing agents for dynamic scheduling in manufacturing

The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using cooperative negotiation. Scheduling resolution requires the intervention of highly skilled human problem-solvers. This is a very hard and challenging domain because current systems are becoming more and more complex, distributed, interconnected and subject to rapidly changing. A natural Autonomic Computing (AC) evolution in relation to Current Computing is to provide systems with Self-Managing ability with a minimum human interference.

Scheduling in holonic manufacturing systems

This chapter presents some of the issues with holonic manufacturing systems. It starts by presenting the current manufacturing scenario and trends and then provides some background information on the holonic concept and its application to manufacturing. The current limitations and future trends of manufacturing suggest more autonomous and distributed organisations for manufacturing systems; holonic manufacturing systems are proposed as a way to achieve such autonomy and decentralisation. After a brief literature survey a specific research work is presented to handle scheduling in holonic manufacturing systems. This work is based on task and resource holons that cooperate with each other based on a variant of the contract net protocol that allow the propagation of constraints between operations in the execution plan. The chapter ends by presenting some challenges and future opportunities of research.

Cooperation mechanism for team-work based multi-agent system in dynamic scheduling through meta-heuristics

This paper describes a Multi-agent Scheduling System that assumes the existence of several Machines Agents (which are decision-making entities) distributed inside the Manufacturing System that interact and cooperate with other agents in order to obtain optimal or near-optimal global performances. Agents have to manage their internal behaviors and their relationships with other agents via cooperative negotiation in accordance with business policies defined by the user manager. Some Multi Agent Systems (MAS) organizational aspects are considered. An original Cooperation Mechanism for a Team-work based Architecture is proposed to address dynamic scheduling using Meta-Heuristics.

Studying the development of an online course on Curriculum : implications for the students' workload in light of the Bologna principles

ECER 2014 "The Past, the Present and Future of Educational Research in Europe" will take place at the University of Porto from 1 - 5 September 2014.

Análise e melhoria de processo de pintura e vulcanização na Continental

A indústria automóvel é um dos setores mais exigentes do mercado global, por este motivo empresas como a Continental Mabor S.A, líderes de mercado, necessitam estar na linha da frente no que toca a programas de melhoria contínua e de uma gestão orientada para um crescimento rentável e sustentado. Nesta perspetiva, este estudo de dissertação tem como objetivo encontrar uma solução para a gestão de stock e FiFo (First in First out) de pneus em verde na supracitada empresa, situada em Lousado, Vila Nova de Famalicão. Este projeto de dissertação iniciou-se com uma análise e diagnóstico do processo produtivo do pneu, entre a Construção e a Vulcanização. Nesta análise, foi possível identificar vários problemas, sendo o mais crítico associado à logística interna de transporte do pneu “em curso”, de fabrico entre as fases do mesmo, Construção e Vulcanização. Devido a condicionantes estruturais e de organização, a logística interna de transporte entre estes dois sectores enfrenta estrangulamentos nos fluxos, a falta de espaço para acomodar o material em curso, problemas organizacionais de controlo e monitorização do processo produtivo, dificuldades de regulação do fluxo e localização dos carros de transporte dos pneus em verde. Face aos problemas detetados ao longo do estudo, foram analisadas várias soluções para a resolução ou minimização dos mesmos. Entre as soluções propostas salientam-se: o alargamento do sistema de transporte por tapetes rolantes GTC (Green Tire Conveying) a todos os módulos de construção. Esta solução diminui o fluxo de carros para a área da construção, descongestionando a zona próxima do sistema de carregamento automático GTAL (Green Tire Automatic Loading) na vulcanização. A implementação dum sistema Wi-Fi RFID, que permite identificar e localizar artigos em curso utilizando etiquetas inteligentes numa rede wireless, conseguindo melhorar a programação de produção e o respetivo sequenciamento. Sabendo também que a Continental se encontra numa fase de expansão, designada Projeto Route 17/20, as soluções propostas tomaram em consideração essa nova realidade futura. Assim, foram estudados e propostos novos layouts para esse atual processo. Nestes novos layouts, procurou-se uma reorganização dos processos de fabrico, bem como um redimensionamento dos espaços de parqueamento de carros de pneus verdes adequado aos volumes produtivos. De igual forma, adequou-se os espaços físicos à possível implementação de um sistema de FiFo de pneus em verde na planta fabril, quando concluída a expansão. Este trabalho de dissertação apresenta como vantagens diretas da sua implementação: gerar a menor perturbação no atual método de trabalho seguido na empresa; previsivelmente aumentar a eficiência do processo produtivo; potenciar o crescimento tecnológico programado pela empresa; e oferecer uma boa relação custo/benefício no investimento necessário. Como apreciação final, pode-se concluir que este estudo foi finalizado com sucesso, visto que as soluções propostas foram apreciadas positivamente pela Administração da Continental Mabor S.A. e estão correntemente a ser avaliadas pelo grupo.

Learner’s satisfaction within a breast imaging eLearning course for radiographers

Background: An asynchronous eLearning system was developed for radiographers in order to promote a better knowledge about senology and mammography. Objectives: to assess the learners’ satisfaction. Methods: Target population included radiographers and radiogr aphy students, in order to assess eLearning satisfaction according to different experience levels in breast imaging. Satisfaction was measured through a questionnaire developed especially for eLearning systems, using a seven - point Likert scale. Main topics related are content, interface, personalization and learning community. Results: Overall, 85% of learners were satisfied with the course and 87,5% considered that the course is successful. Main areas that were evaluated by most learners in a positive way were interface and content (between six and seven - point); on the other hand, learning community presented a wider distribution of answers . Conclusions: The course provides an overall high degree of learner satisfaction, thus providing more effective knowle dge gain on breast imaging for radiographers.

Stochastic short-term maintenance scheduling of GENCOs in an oligopolistic electricity market

In the proposed model, the independent system operator (ISO) provides the opportunity for maintenance outage rescheduling of generating units before each short-term (ST) time interval. Long-term (LT) scheduling for 1 or 2 years in advance is essential for the ISO and the generation companies (GENCOs) to decide their LT strategies; however, it is not possible to be exactly followed and requires slight adjustments. The Cournot-Nash equilibrium is used to characterize the decision-making procedure of an individual GENCO for ST intervals considering the effective coordination with LT plans. Random inputs, such as parameters of the demand function of loads, hourly demand during the following ST time interval and the expected generation pattern of the rivals, are included as scenarios in the stochastic mixed integer program defined to model the payoff-maximizing objective of a GENCO. Scenario reduction algorithms are used to deal with the computational burden. Two reliability test systems were chosen to illustrate the effectiveness of the proposed model for the ST decision-making process for future planned outages from the point of view of a GENCO.

Application-specific modified particle swarm optimization for energy resource scheduling considering vehicle-to-grid

This paper presents a modified Particle Swarm Optimization (PSO) methodology to solve the problem of energy resources management with high penetration of distributed generation and Electric Vehicles (EVs) with gridable capability (V2G). The objective of the day-ahead scheduling problem in this work is to minimize operation costs, namely energy costs, regarding he management of these resources in the smart grid context. The modifications applied to the PSO aimed to improve its adequacy to solve the mentioned problem. The proposed Application Specific Modified Particle Swarm Optimization (ASMPSO) includes an intelligent mechanism to adjust velocity limits during the search process, as well as self-parameterization of PSO parameters making it more user-independent. It presents better robustness and convergence characteristics compared with the tested PSO variants as well as better constraint handling. This enables its use for addressing real world large-scale problems in much shorter times than the deterministic methods, providing system operators with adequate decision support and achieving efficient resource scheduling, even when a significant number of alternative scenarios should be considered. The paper includes two realistic case studies with different penetration of gridable vehicles (1000 and 2000). The proposed methodology is about 2600 times faster than Mixed-Integer Non-Linear Programming (MINLP) reference technique, reducing the time required from 25 h to 36 s for the scenario with 2000 vehicles, with about one percent of difference in the objective function cost value.

Static-priority scheduling of sporadic messages on a wireless channel

Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel.

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

In this paper we survey the most relevant results for the prioritybased schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages’ response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

Scheduling IP traffic in multimedia-enabled PROFIBUS networks

Technological developments are pulling fieldbus networks to support a new wide class of applications, such as industrial multimedia applications. To enable its use in this kind of applications the TCP/IP suite of protocols can be integrated within a fieldbus stack, leading to a dual-stack approach that is briefly outlined in the paper. One important requirement that must be fulfilled by this approach is that the hard real-time guarantees provided to the control-related traffic ("native" fieldbus traffic) are kept. At the same time it must also provide the desired quality of service (QoS) to IP applications. The focus of the paper is on how, in such a dual-stack approach, QoS can be efficiently provided to IP applications requiring quasi-constant bandwidth.

Non pre-emptive scheduling of messages on SMTV token-passing networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, a single message per token visit (SMTV). In this paper, we establish an analogy between non-preemptive task scheduling in single processors and the scheduling of messages on SMTV token-passing networks. Moreover, we clearly show that concepts such as blocking and interference in non-preemptive task scheduling have their counterparts in the scheduling of messages on SMTV token-passing networks. Based on this task/message scheduling analogy, we provide pre-run-time schedulability conditions for supporting real-time messages with SMTV token-passing networks. We provide both utilisation-based and response time tests to perform the pre-run-time schedulability analysis of real-time messages on SMTV token-passing networks, considering RM/DM (rate monotonic/deadline monotonic) and EDF (earliest deadline first) priority assignment schemes

Scheduling real-time communications with P-NET

In this paper we address the P-NET Medium Access Control (MAC) ability to schedule traffic according to its real-time requirements, in order to support real-time distributed applications. We provide a schedulability analysis based on the P-NET standard, and propose mechanisms to overcome priority inversion problems resulting from the use of FIFO outgoing buffers

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Preemption delay analysis for floating non-preemptive region scheduling

In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling. Non-preemptive scheduling is obviously not subject to any preemption delay but its schedulability may be quite poor, whereas fully preemptive scheduling is subject to preemption delay, but benefits from a higher flexibility in the scheduling decisions. The time-delay involved by task preemptions is a major source of pessimism in the analysis of the task Worst-Case Execution Time (WCET) in real-time systems. Preemptive scheduling policies including non-preemptive regions are a hybrid solution between non-preemptive and fully preemptive scheduling paradigms, which enables to conjugate both world's benefits. In this paper, we exploit the connection between the progression of a task in its operations, and the knowledge of the preemption delays as a function of its progression. The pessimism in the preemption delay estimation is then reduced in comparison to state of the art methods, due to the increase in information available in the analysis.