Jobshop Scheduling Problem for Parallel Machine Using Genetic Algorithm

Simple item page
dc.contributor.authorSivarajah, S.
dc.date.accessioned2021-11-03T09:20:19Z
dc.date.available2021-11-03T09:20:19Z
dc.date.issued2013
dc.description.abstractThe Job-Shop Scheduling Problem (JSSP) is a non-polynomial hard problem. The main objective of the JSSP is to find a schedule for jobs, to optimize a given performance measure. In this research we used maximum completion time, which is the maximum time needed to process all n number of jobs on m number of machines. They cannot be formulated as a linear programming problem and no simple rules or algorithms yield to optimal solutions in a short time. In this paper we used a modified Genetic Algorithm (GA) approach to solve the problem of job shop scheduling.en_US
dc.identifier.otherUWU/SCT/09/0035
dc.identifier.urihttp://www.erepo.lib.uwu.ac.lk/bitstream/handle/123456789/7553/SCT%2009%20035-27102021144836.pdf?sequence=1&isAllowed=y
dc.language.isoenen_US
dc.publisherUva Wellassa University of Sri Lankaen_US
dc.relation.ispartofseries;UWU/SCT/09/0035
dc.subjectScience and Technology Degree Programme (SCT)en_US
dc.titleJobshop Scheduling Problem for Parallel Machine Using Genetic Algorithmen_US
dc.title.alternativeResearch Article – SCT 2013en_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
SCT 09 035-27102021144836.pdf
Size:
38.17 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Science and Technology Degree Programme (SCT)