Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm

Journal Title: Indian Journal of Computer Science and Engineering - Year 2013, Vol 4, Issue 2

Abstract

The n-job, m-machine scheduling problem is one of the general scheduling problems in a system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. In this paper, Selective Breeding Algorithm (SBA) and Hybrid Algorithm (HA) are used for finding optimal for different size benchmark problems. Hybrid Algorithm has Artificial Immune system and shifting bottleneck procedure. The results show that the Selective Breeding algorithm is an efficient and effective algorithm that gives better results than other algorithms compared in literature. The proposed algorithm is a good problem-solving technique for scheduling problems.

Authors and Affiliations

P. Sriramya , B. Parvathavarthini , M. Chandrasekaran

Keywords

Related Articles

WEB BASED E-LEARNING IN INDIA: THE CUMULATIVE VIEWS OF DIFFERENT ASPECTS

In the presence of great social diversity in India, it is difficult to change the social background of students, parents and their economical conditions. Therefore the only option left for us is to provide uniform or sta...

Program and Data Protection: Copyright, Patent, Trade Secret and Trademark

The study of this paper will describe the perspective view of legal issues and propose the alternative approaches to protecting software. Some legal issues like copyright, patent and trademark are used for providing the...

Green Cloud: Smart Resource Allocation and Optimization using Simulated Annealing Technique

Cloud computing aims to offer utility based IT services by interconnecting large number of computers through a real-time communication network such as the Internet. There has been a significant increase in the power cons...

Functional Verification of Enhanced RISC Processor

This paper presents design and verification of a 32-bit enhanced RISC processor core having floating point computations integrated within the core, has been designed to reduce the cost and complexity. The designed 3 stag...

THE MAIN FEATURE FOR SUCCESSFUL IMPLEMENTATION A DATA WAREHOUSE

Data warehousing is the leading and most reliable technology used today by companies for planning, forecasting, and management A lot has been done in this field regarding design and development of data warehouses and a l...

Download PDF file
  • EP ID EP151405
  • DOI -
  • Views 102
  • Downloads 0

How To Cite

P. Sriramya, B. Parvathavarthini, M. Chandrasekaran (2013). Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm. Indian Journal of Computer Science and Engineering, 4(2), 86-90. https://europub.co.uk/articles/-A-151405