Task scheduling and management using genetic algorithms with application in production process optimisation

2012 ◽  
Vol 7 (3) ◽  
pp. 273 ◽  
Author(s):  
L.B. Gamage ◽  
C.W. de Silva
2012 ◽  
Vol 17 (4) ◽  
pp. 241-244
Author(s):  
Cezary Draus ◽  
Grzegorz Nowak ◽  
Maciej Nowak ◽  
Marcin Tokarski

Abstract The possibility to obtain a desired color of the product and to ensure its repeatability in the production process is highly desired in many industries such as printing, automobile, dyeing, textile, cosmetics or plastics industry. So far, most companies have traditionally used the "manual" method, relying on intuition and experience of a colorist. However, the manual preparation of multiple samples and their correction can be very time consuming and expensive. The computer technology has allowed the development of software to support the process of matching colors. Nowadays, formulation of colors is done with appropriate equipment (colorimeters, spectrophotometers, computers) and dedicated software. Computer-aided formulation is much faster and cheaper than manual formulation, because fewer corrective iterations have to be carried out, to achieve the desired result. Moreover, the colors are analyzed with regard to the metamerism, and the best recipe can be chosen, according to the specific criteria (price, quantity, availability). Optimaization problem of color formulation can be solved in many diferent ways. Authors decided to apply genetic algorithms in this domain.


Author(s):  
João Phellipe ◽  
Carla Katarina ◽  
Francisco das Chagas ◽  
Dario Aloise

Computer processing power has evolved considerably in recent years. However, there are problems that still require many machines to perform a large amount of processing in a parallel and distributed way. In this context, the task scheduling in a distributed system present many algorithms. In this chapter, the authors present a scheduler based on genetic algorithms in order to distribute tasks more efficiently in a computational grid; it has been implemented in GRIDSIM, a computational grid simulator with the features and attributes of a real grid.


2011 ◽  
Vol 22 (03) ◽  
pp. 603-620 ◽  
Author(s):  
WEI SUN

Genetic algorithms (GAs) have been well applied in solving scheduling problems and their performance advantages have also been recognized. However, practitioners are often troubled by parameters setting when they are tuning GAs. Population Size (PS) has been shown to greatly affect the efficiency of GAs. Although some population sizing models exist in the literature, reasonable population sizing for task scheduling is rarely observed. In this paper, based on the PS deciding model proposed by Harik, we present a model to represent the relation between the success ratio and the PS for the GA applied in time-critical task scheduling, in which the efficiency of GAs is more necessitated than in solving other kinds of problems. Our model only needs some parameters easy to know through proper simplifications and approximations. Hence, our model is applicable. Finally, our model is verified through experiments.


1991 ◽  
Vol 26 (1) ◽  
pp. 1-5 ◽  
Author(s):  
Krishna Nand ◽  
S. Sumithra Devi ◽  
Prema Viswanath ◽  
Somayaji Deepak ◽  
R. Sarada

2019 ◽  
Author(s):  
Eduardo Silva ◽  
Paulo Gabriel

This paper reports a systematic review of the literature about genetic algorithms applied to the multiprocessor task scheduling problem. After defining a protocol with the main rules of this review, the research was performed considering journal papers published between 1990 and 2018. At the end of this process, 37 works were recovered and analyzed. By performing a meta-analysis, a variety of information was extracted and summarized, including impact factor, Eigenfactor score, scenarios considered, optimization metrics, volume of citations, and others.


Sign in / Sign up

Export Citation Format

Share Document