Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleJob shop scheduling to minimize work-in-process, earliness and tardiness costs
dc.contributor.authorZHU ZHECHENG
dc.identifier.citationZHU ZHECHENG (2009-01-06). Job shop scheduling to minimize work-in-process, earliness and tardiness costs. ScholarBank@NUS Repository.
dc.description.abstractOur research is motivated by a scenario of a manufacturing company receiving highly customized orders from different customers. A good production schedule is required to complete the orders on time with the limited resources and minimize the relevant costs. Such a scenario is modelled as a job shop problem with non-regular performance measure (shorted as JIT-JSP). The objective of JIT-JSP is to minimize three inventory related costs: Work in process (WIP) holding, earliness and tardiness cost.Schedule generation procedures including idle time insertion are studied to generate feasible schedule for JIT-JSP. A modified tabu search algorithm (MTS) is developed to improve the schedule quality by searching the neighborhood for better schedules iteratively. A dispatching rule selector based on neural network is developed to solve the performance fluctuation of dispatching rules. Computational results show that the proposed procedures significantly improve the schedule quality.
dc.subjectjob shop scheduling, just in time, schedule generation procedure, idle time insertion, tabu search, dispatching rule selector
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.contributor.supervisorNG KIEN MING
dc.description.degreeconferredDOCTOR OF PHILOSOPHY
Appears in Collections:Ph.D Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ZhuZC.pdf1.52 MBAdobe PDF



Page view(s)

checked on May 16, 2019


checked on May 16, 2019

Google ScholarTM


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