Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/44845
Title: Local search methods for job shop scheduling problem
Authors: Kannan, Jayesh.
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2011
Abstract: Rapid 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.
URI: http://hdl.handle.net/10356/44845
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With 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

Page view(s) 50

274
Updated on Nov 30, 2020

Download(s)

26
Updated on Nov 30, 2020

Google ScholarTM

Check

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