Repository logo
 
Publication

A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

dc.contributor.authorMagalhães-Mendes, J.
dc.date.accessioned2014-03-28T12:45:12Z
dc.date.available2014-03-28T12:45:12Z
dc.date.issued2011
dc.description.abstractThis paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.por
dc.identifier.isbn9789604742738
dc.identifier.urihttp://hdl.handle.net/10400.22/4287
dc.language.isoengpor
dc.peerreviewedyespor
dc.publisherACMpor
dc.relation.ispartofseriesAIKED'11;
dc.relation.publisherversionhttp://dl.acm.org/citation.cfm?id=1959491por
dc.titleA genetic algorithm for the job shop scheduling with a new local search using Monte Carlo methodpor
dc.typejournal article
dspace.entity.typePublication
oaire.citation.conferencePlaceCambridge, UKpor
oaire.citation.endPage31por
oaire.citation.startPage26por
oaire.citation.title10th WSEAS international conference on Artificial intelligence, knowledge engineering and data basespor
rcaap.rightsclosedAccesspor
rcaap.typearticlepor

Files