Publication:
A genetic algorithm for scheduling of jobs on lines of press machines

Simple item page
dc.contributor.authorLirkov, I.
dc.contributor.authorMargenov, S.
dc.contributor.authorWasniewski, J.
dc.contributor.buuauthorÖzalp, Selma Ayşe
dc.contributor.departmentMühendislik Mimarlık Fakültesi
dc.contributor.departmentEndüstri Mühendisliği Bölümü
dc.contributor.orcid0000-0001-9201-6349
dc.contributor.researcheridG-1584-2018
dc.contributor.researcheridI-9828-2018
dc.contributor.scopusid6603978393
dc.date.accessioned2023-10-27T08:10:30Z
dc.date.available2023-10-27T08:10:30Z
dc.date.issued2006
dc.descriptionBu çalışma, 06-10, Haziran 2005 tarihlerinde Sozopol[Bulgaristan]’da düzenlenen 5. International Conference on Large-Scale Scientific Computing (LSSC 2005) Kongresi‘nde bildiri olarak sunulmuştur.
dc.description.abstractThis paper introduces a Genetic Algorithm (GA) based solution technique for press machines scheduling problem of a car manufacturing factory. Firstly, the problem at hand, and the application of the CA in terms of coding, chromosome evaluation, crossover and Mutation operators, are described in detail. After that, the CA is experimentally evaluated through some test problems. As the objective of the problem is the minimization of the completion time of the jobs, the CA based solution is compared with the Longest Processing Time (LPT) rule, and it is observed that the CA always produces better schedules than the LPT rule in a reasonably short amount of CPU time.
dc.description.sponsorshipBulgarian Acad Sci, Inst Parallel Proc
dc.identifier.citationÖzalp, S. A. (2006). ''A genetic algorithm for scheduling of jobs on lines of press machines''. ed. İ. Lirkov, S. Margenov, J. Wasniewski. Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, 3743, 535-543.
dc.identifier.endpage543
dc.identifier.isbn3-540-31994-8
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-33745323220
dc.identifier.startpage535
dc.identifier.urihttps://doi.org/10.1007/11666806_61
dc.identifier.urihttps://link.springer.com/chapter/10.1007%2F11666806_61
dc.identifier.urihttp://hdl.handle.net/11452/34617
dc.identifier.volume3743
dc.identifier.wos000236456400061
dc.indexed.wosCPCIS
dc.indexed.wosSCIE
dc.language.isoen
dc.publisherSpringer
dc.relation.journalLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectComputer science
dc.subjectParallel machines
dc.subjectScheduling
dc.subjectProgram processors
dc.subjectProblem solving
dc.subjectMutagens
dc.subjectChromosomes
dc.subjectPress machines
dc.subjectLongest processing time (LPT) rule
dc.subjectChromosome evaluation
dc.subjectGenetic algorithms
dc.subject.scopusCommissioning; Virtual Manufacturing; Simulation
dc.subject.wosComputer science, theory & methods
dc.titleA genetic algorithm for scheduling of jobs on lines of press machines
dc.typeArticle
dc.typeProceedings Paper
dspace.entity.typePublication
local.contributor.departmentMühendislik Mimarlık Fakültesi/Endüstri Mühendisliği Bölümü
local.indexed.atScopus
local.indexed.atWOS

Files

License bundle

Now showing 1 - 1 of 1
Placeholder
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

İndeksli Yayınlar / Indexed Publications