Ulbricht, Michal
March 2012
International Journal on Information Technologies & Security;2012, Vol. 4 Issue 1, p3
Academic Journal
In this paper single-objective and multi-objective algorithms are compared using a simplified grid environment. Class of single-objective algorithms is represented by genetic algorithm and simulated annealing. Those two algorithms are compared to their multi-objective versions - archived multi-objective simulated annealing and improved strength Pareto evolutionary algorithm. Algorithms are compared via efficiency of reaching best solutions given by users preferences on two criteria (computation speed and computation cost).


Related Articles

  • A Multi-Level GA Search with Application to the Resource-Constrained Re-Entrant Flow Shop Scheduling Problem. Lin, Danping; Lee, C. K. M. // World Academy of Science, Engineering & Technology;2012, Issue 64, p746 

    Re-entrant scheduling is an important search problem with many constraints in the flow shop. In the literature, a number of approaches have been investigated from exact methods to meta-heuristics. This paper presents a genetic algorithm that encodes the problem as multi-level chromosomes to...

  • Heuristic search algorithms for lot streaming in a two-machine flowshop. Marimuthu, S.; Ponnambalam, S.G. // International Journal of Advanced Manufacturing Technology;Nov2005, Vol. 27 Issue 1/2, p174 

    The objective of this paper is to propose and evaluate heuristic search algorithms for a two-machine flowshop problem with multiple jobs requiring lot streaming that minimizes makespan. A job here implies many identical items. Lot streaming creates sublots to move the completed portion of a...

  • Solving a two-stage assembly flowshop scheduling problem to minimize the mean tardiness and earliness penalties by three meta-heuristics. Seyedi, Iman; Maleki-Daronkolaei, Aref // Caspian Journal of Applied Sciences Research;2013, Vol. 2 Issue 4, p67 

    This paper presents a new mathematical model for a two-stage assembly flowshop scheduling problem that minimizes the mean tardiness and earliness penalties. This problem is an extension of the assembly flow shop problem with simultaneous operations in the first stage and a single assembly...

  • Grid Scheduling using Differential Evolution (DE) for solving multi-objective optimization parameters. Jayasudha, A. R.; Phil, M.; Purusothaman, T. // International Journal on Computer Science & Engineering;2010, p2322 

    The computational grid is a collection and aggregation of parallel, distributed, and heterogeneous resources. Grid Scheduling is the complex issue to manage the heterogeneous resources. The proposed approach considers the evolutionary algorithm of Differential Evolution (DE) technique in a...

  • An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. Rabiee, M.; Sadeghi Rad, Reza; Mazinani, M.; Shafaei, R. // International Journal of Advanced Manufacturing Technology;Mar2014, Vol. 71 Issue 5-8, p1229 

    This paper addresses the problem of no-wait two-stage flexible flow shop scheduling problem (NWTSFFSSP) considering unrelated parallel machines, sequence-dependent setup times, probable reworks and different ready times to actualize the problem. The performance measure used in this study is...

  • Job Scheduling in Grid Computing with Cuckoo Optimization Algorithm. Rabiee, Maryam; Sajedi, Hedieh // International Journal of Computer Applications;2013, Vol. 62, p38 

    Computational grid is a hardware and software infrastructure that provides dependable, inclusive and credible to other computing capabilities. Grid computing intercommunicated with a set of computational resources on a large scale. Scheduling independent jobs is an important issues in such areas...

  • Prioritized User Demand Approach for Scheduling Meta Tasks on Heterogeneous Grid Environment. Suresh, P.; Balasubramanie, P.; Keerthika, P. // International Journal of Computer Applications;Jun2011, Vol. 23, p6 

    Due to the rapid evolution of grid computing, which deals with the effective utilization of the globally distributed computer resources to solve massive problems, grid scheduling is the major focus. Efficient scheduling algorithms are the need of the hour to achieve efficient utilization of the...

  • A Novel Algorithm Applied to Task Scheduling in Grid Computing. Wang, Wei; Luo, Daisheng; Shu, Wanneng; Fang, Yong // International Journal of Distributed Sensor Networks;Jan/Feb2009, Vol. 5 Issue 1, p101 

    In this paper a novel optimal scheduling model and its algorithm are developed for task scheduling problems. A novel annealing-inspired genetic algorithm is applied to solve the scheduling model. The effectiveness of the algorithm is shown for a number of test problems and performance...

  • Project Management With Uncertain Task Times. Wodecki, Mieczysław; Bożejko, Wojciech // Proceedings of the European Conference on Management, Leadership;2010, p373 

    In this paper, parallel simulated annealing with genetic enhancement algorithm (HSG) is presented and applied to permutation flow shop scheduling problem which has been proven to be NP-complete in the strong sense. The metaheuristics is based on a new clustering algorithm for simulated annealing...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics