5,591 research outputs found
An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
This article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, and from the total search of the agent, the NEH-EDD algorithm was applied. Moreover, the diversity of the nominee schedule was improved through the use of swap mutation, flip, and slide to determine the best solution in each iteration. Finally, the HALO was compared with some algorithms, while some numerical experiments were used to show the performances of the proposed algorithms. It is important to note that comparative analysis has been previously conducted using the nine variations of the PFSSP problem, and the HALO obtained was compared to other algorithms based on numerical experiments
Energy-Flexible Job-Shop Scheduling Using Deep Reinforcement Learning
Considering its high energy demand, the manufacturing industry has grand potential for demand response studies to increase the use of clean energy while reducing its own electricity cost. Production scheduling, driven by smart demand response services, plays a major role in adjusting the manufacturing sector to the volatile energy market. As a state-of-the-art method for scheduling problems, reinforcement learning has not yet been applied to the job-shop scheduling problem with demand response objectives. To address this gap, we conceptualize and implement deep reinforcement learning as a single-agent approach, combining energy cost and makespan minimization objectives. We consider makespan as an ancillary objective in order not to entirely abandon the timely completion of production operations while assigning different weights to both objectives and analyzing the resulting trade-offs between them. Our main contribution is the integration of the energy cost-related objective. We present two innovative reward functions, which consider the dynamic energy prices to select a job for the machine or allow the machine idle. The reinforcement learning agent finds optimal schedules determined by cumulative energy costs for benchmark scheduling cases from the literature
A common framework and taxonomy for multicriteria scheduling problems with Interfering and competing Jobs: Multi-agent scheduling problems
Most classical scheduling research assumes that the objectives sought are common to all jobs to be
scheduled. However, many real-life applications can be modeled by considering different sets of jobs,
each one with its own objective(s), and an increasing number of papers addressing these problems has
appeared over the last few years. Since so far the area lacks a uni ed view, the studied problems
have received different names (such as interfering jobs, multi-agent scheduling, mixed-criteria, etc), some
authors do not seem to be aware of important contributions in related problems, and solution procedures
are often developed without taking into account existing ones. Therefore, the topic is in need of a common
framework that allows for a systematic recollection of existing contributions, as well as a clear de nition
of the main research avenues. In this paper we review multicriteria scheduling problems involving two or
more sets of jobs and propose an uni ed framework providing a common de nition, name and notation
for these problems. Moreover, we systematically review and classify the existing contributions in terms
of the complexity of the problems and the proposed solution procedures, discuss the main advances, and
point out future research lines in the topic
Towards a conceptual design of intelligent material transport using artificial intelligence
Reliable and efficient material transport is one of the basic requirements that affect productivity in industry. For that reason, in this paper two approaches are proposed for the task of intelligent material transport by using a mobile robot. The first approach is based on applying genetic algorithms for optimizing process plans. Optimized process plans are passed to the genetic algorithm for scheduling which generate an optimal job sequence by using minimal makespan as criteria. The second approach uses graph theory for generating paths and neural networks for learning generated paths. The Matla
Adaptive Dispatching of Tasks in the Cloud
The increasingly wide application of Cloud Computing enables the
consolidation of tens of thousands of applications in shared infrastructures.
Thus, meeting the quality of service requirements of so many diverse
applications in such shared resource environments has become a real challenge,
especially since the characteristics and workload of applications differ widely
and may change over time. This paper presents an experimental system that can
exploit a variety of online quality of service aware adaptive task allocation
schemes, and three such schemes are designed and compared. These are a
measurement driven algorithm that uses reinforcement learning, secondly a
"sensible" allocation algorithm that assigns jobs to sub-systems that are
observed to provide a lower response time, and then an algorithm that splits
the job arrival stream into sub-streams at rates computed from the hosts'
processing capabilities. All of these schemes are compared via measurements
among themselves and with a simple round-robin scheduler, on two experimental
test-beds with homogeneous and heterogeneous hosts having different processing
capacities.Comment: 10 pages, 9 figure
Koncepcijsko projektiranje inteligentnog unutarnjeg transporta materijala koriŔtenjem umjetne inteligencije
Reliable and efficient material transport is one of the basic requirements that affect productivity in industry. For that reason, in this paper two approaches are proposed for the task of intelligent material transport by using a mobile robot. The first approach is based on applying genetic algorithms for optimizing process plans. Optimized process plans are passed to the genetic algorithm for scheduling which generate an optimal job sequence by using minimal makespan as criteria. The second approach uses graph theory for generating paths and neural networks for learning generated paths. The MatlabĀ© software package is used for developing genetic algorithms, manufacturing process simulation, implementing search algorithms and neural network training. The obtained paths are tested by means of the Khepera II mobile robot system within a static laboratory model of manufacturing environment. The experiment results clearly show that an intelligent mobile robot can follow paths generated by using genetic algorithms as well as learn and predict optimal material transport flows thanks to using neural networks. The achieved positioning error of the mobile robot indicates that the conceptual design approach based on the axiomatic design theory can be used for designing the material transport and handling tasks in intelligent manufacturing systems.Pouzdan i efikasan transport materijala je jedan od kljuÄnih zahtjeva koji utjeÄe na poveÄanje produktivnosti u industriji. Iz tog razloga, u radu su predložena dva pristupa za inteligentan transport materijala koriÅ”tenjem mobilnog robota. Prvi pristup se zasniva na primjeni genetskih algoritama za optimizaciju tehnoloÅ”kih procesa. Optimalna putanja se dobiva koriÅ”tenjem optimalnih tehnoloÅ”kih procesa i genetskih algoritama za vremensko planiranje, uz minimalno vrijeme kao kriterij. Drugi pristup je temeljen na primjeni teorije grafova za generiranje putanja i neuronskih mreža za uÄenje generirane putanje. MatlabĀ© softverski paket je koriÅ”ten za razvoj genetskih algoritama, simulaciju tehnoloÅ”kih procesa, implementaciju algoritama pretraživanja i obuÄavanje neuronskih mreža. Dobivene putanje su testirane pomoÄu Khepera II mobilnog robota u statiÄkom laboratorijskom modelu tehnoloÅ”kog okruženja. Eksperimentalni rezultati pokazuju kako inteligentni mobilni robot prati putanje generirane koriÅ”tenjem genetskih algoritama, kao i da uÄi i predviÄa optimalne tokove materijala zahvaljujuÄi neuronskim mrežama. Ostvarena pogreÅ”ka pozicioniranja mobilnog robota ukazuje da se koncepcijski pristup baziran na aksiomatskoj teoriji projektiranja može koristiti u projektiranju transporta i manipulacije u inteligentnom tehnoloÅ”kom sustavu
Towards a conceptual design of intelligent material transport using artificial intelligence
Reliable and efficient material transport is one of the basic requirements that affect productivity in industry. For that reason, in this paper two approaches are proposed for the task of intelligent material transport by using a mobile robot. The first approach is based on applying genetic algorithms for optimizing process plans. Optimized process plans are passed to the genetic algorithm for scheduling which generate an optimal job sequence by using minimal makespan as criteria. The second approach uses graph theory for generating paths and neural networks for learning generated paths. The Matla
- ā¦