HEAL DSpace

Transfer batch scheduling using genetic algorithms

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Millas, VS en
dc.contributor.author Vosniakos, GC en
dc.date.accessioned 2014-03-01T01:57:38Z
dc.date.available 2014-03-01T01:57:38Z
dc.date.issued 2008 en
dc.identifier.issn 0020-7543 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/28457
dc.subject genetic algorithms en
dc.subject heuristics en
dc.subject batch scheduling en
dc.subject transfer batches en
dc.subject.classification Engineering, Industrial en
dc.subject.classification Engineering, Manufacturing en
dc.subject.classification Operations Research & Management Science en
dc.subject.other JOB-SHOP SCHEDULING/ en
dc.subject.other MANUFACTURING SYSTEMS en
dc.subject.other PERFORMANCE en
dc.title Transfer batch scheduling using genetic algorithms en
heal.type journalArticle en
heal.language English en
heal.publicationDate 2008 en
heal.abstract This paper examines scheduling in a manufacturing system with transfer batches. Transfer batches are considered as different batches although they stem from the same job. Genetic algorithms determine the size of the transfer batches for each job and the final schedule with a makespan criterion. A novelty of the genetic algorithm developed is twin chromosome encoding, the first chromosome representing the relative size (participation ratio) of each transfer batch with respect to the whole batch; and the second chromosome applying in effect a dynamic heuristic dispatching rule representation for resolving operation antagonism. New crossover and mutation operators were employed for the first chromosome and standard operators for the second. The genetic algorithms were coded in C++ for better control. A 20 job x eight machine shop was used as a test case. Results favour genetic algorithms over heuristic procedures, but the latter close the gap with an increase in the number of transfer batches. Design of Experiments was used to focus on the most promising genetic algorithm parameter value combinations. en
heal.publisher TAYLOR & FRANCIS LTD en
heal.journalName INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH en
dc.identifier.isi ISI:000252337900007 en
dc.identifier.volume 46 en
dc.identifier.issue 4 en
dc.identifier.spage 993 en
dc.identifier.epage 1016 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής