Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/14440
Title: Planning in parallel machine shops and scheduling of flexible process plans in mould manufacturing shop
Authors: SARAVANAKUMAR MOHANRAJ
Keywords: Parallel machines, Genetic algorithm, Simulated annealing algorithm, Tabu search, Memetic algorithm, Sequencing and Scheduling, Mould shop planning
Issue Date: 13-Jan-2005
Source: SARAVANAKUMAR MOHANRAJ (2005-01-13). Planning in parallel machine shops and scheduling of flexible process plans in mould manufacturing shop. ScholarBank@NUS Repository.
Abstract: In todaya??s competitive market, lead time of the product decides the survival of manufacturing industries. In this research, efforts are taken with an emphasis to improve the planning tasks in parallel machine shops. Sequencing and scheduling complexities prevalent in parallel machine shops are usually solved using heuristic and Meta heuristic algorithms. Two heuristic algorithms are proposed to solve the computational time complexities of parallel machine shops. One of the developed heuristic algorithms provides the polynomial time solution for this case. Studies are also conducted with four Meta heuristic algorithms namely genetic algorithm, simulated annealing algorithm, tabu search and memetic algorithm to improve the planning problems in parallel machine shops. A new approach which can combine the sequencing and scheduling tasks of parallel machine shops are developed and evaluated. This research also deals with the scheduling of flexible process plans in mould manufacturing shops.
URI: http://scholarbank.nus.edu.sg/handle/10635/14440
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Saravanakumar Mohanraj.pdf900.03 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

364
checked on Dec 11, 2017

Download(s)

465
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.