Exact methods for the robotic cell problem
dc.contributor.author | Kharbeche, M. | |
dc.contributor.author | Carlier, J. | |
dc.contributor.author | Haouari, Mohamed | |
dc.contributor.author | Moukrim, A. | |
dc.date.accessioned | 2013-10-26T13:36:38Z | |
dc.date.available | 2013-10-26T13:36:38Z | |
dc.date.issued | 2011-06 | |
dc.identifier.issn | 1936-6582 | |
dc.identifier.uri | http://hdl.handle.net/10679/299 | |
dc.identifier.uri | http://link.springer.com/article/10.1007%2Fs10696-011-9079-2# | |
dc.description.abstract | This paper investigates an exact method for the Robotic Cell Problem. We present a branch-and-bound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. Also, we propose a new mathematical programming model as well as new lower bounds. Furthermore, we describe an effective genetic algorithm that includes, as a mutation operator, a local search procedure. We report the results of a computational study that provides evidence that medium-sized instances, with up to 176 operations, can be optimally solved. Also, we found that the new proposed lower bounds outperform lower bounds from the literature. Finally, we show, that the genetic algorithm delivers good solutions while requiring short CPU times. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer Science+Business Media | en_US |
dc.relation.ispartof | Flexible Services and Manufacturing Journal | |
dc.rights | restrictedAccess | |
dc.title | Exact methods for the robotic cell problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0003-0767-8220 & YÖK ID ) Haouari, Mohamed | |
dc.contributor.ozuauthor | Haouari, Mohamed | |
dc.identifier.volume | 23 | |
dc.identifier.issue | 2 | |
dc.identifier.startpage | 242 | |
dc.identifier.endpage | 261 | |
dc.identifier.wos | WOS:000293790700008 | |
dc.identifier.doi | 10.1007/s10696-011-9079-2 | |
dc.subject.keywords | Robotic cell | en_US |
dc.subject.keywords | Flow shop with transportation times and blocking | en_US |
dc.subject.keywords | Branch-and-bound | en_US |
dc.subject.keywords | Lower bounds | en_US |
dc.subject.keywords | Genetic algorithms | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-79960565314 | |
dc.contributor.authorMale | 1 | |
dc.relation.publicationcategory | Article - International Refereed Journal - Institutional Academic Staff |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
Share this page