Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKannan, Jayesh.-
dc.description.abstractRapid globalization over the past few years is leading to intense competition among manufacturers throughout the world over lower product costs, shorter product life cycles and more product variety. An effective scheduling system for the various jobs is needed to cope with this competition in order to reduce inventory levels and cycle times while improving on-time delivery and the utilization of critical resources. Combinatorial Optimization Problems (COPs) is an important research area due to its common occurrence in real-world scheduling problems in many industries. A representative problem of COPs is the Job Shop Scheduling Problem (JSSP). This project investigates various approximate methods including the constructive approach of Insertion algorithms and Local Search techniques of Variable Neighbourhood Search and Simulated Annealing incorporated with Multiple-Type Individual Enhancement. It discusses an improvement for makespan calculation.en_US
dc.format.extent79 p.en_US
dc.rightsNanyang Technological University-
dc.subjectDRNTU::Engineering::Computer science and engineeringen_US
dc.titleLocal search methods for job shop scheduling problemen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorLow Yoke Hean, Malcolmen_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.description.degreeBachelor of Engineering (Computer Engineering)en_US
dc.contributor.researchParallel and Distributed Computing Centreen_US
item.fulltextWith Fulltext-
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
FYP Amended Report.pdf
  Restricted Access
1.56 MBAdobe PDFView/Open

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.