alexa A GA for the Resource Sharing and Scheduling Problem
ISSN: 2229-8711

Global Journal of Technology and Optimization
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Review Article

A GA for the Resource Sharing and Scheduling Problem

Gaby Pinto1*, Uriel Israelí2, Inessa Ainbinder3, Gad Rabinowitz3

1Department of Industrial Engineering and Management, Ben Gurion University of the Negev, Israel

2Department of Technology Management, Holon Institute of Technology, Israel

3Department of Industrial Engineering and Management, Ben Gurion University of the Negev, Israel

*Corresponding Author:
Gaby Pinto
Department of Industrial Engineering and Management, Ben Gurion University of the Negev, Israel
E-mail: [email protected]

Received date: May 2008; Revised date: September 2008; Accepted date: March 2009

 

Abstract

In this paper we consider the resource-sharing and scheduling problem, with makespan minimization as an objective. Although this problem was optimally solved through a customized branch-and-bound algorithm, its complexity motivated the use of heuristics such as genetic algorithms. A previous genetic algorithm used for solving this problem was significantly faster than the branch-andbound algorithm; however, it suffered from a high rate of infeasible offspring. We propose a new genetic approach, which produces only feasible offspring via a much more compact, genotype representation of the solution. While in the previous genetic algorithm the chromosome consisted of all the solution 0-1 variables (genotype=phenotype), in the new algorithm we define a much smaller chromosome (genotype) that stores sufficient information for efficiently generating a solution for the 0-1 variables (phenotype).

Keywords

Share This Page

Additional Info

Loading
Loading Please wait..
 
Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords