Author: Lee, Ying-choon
Title: A study of tabu search model for scheduling manufacturing job shop
Degree: M.B.A.
Year: 1995
Subject: Scheduling -- Data processing
Hong Kong Polytechnic University -- Dissertations
Department: Department of Management
Pages: viii, 62, [76] leaves : ill. ; 30 cm
Language: English
Abstract: The objective of this research is to study the feasibility and practicability of applying tabu search model to the job shop scheduling problem. In order to achieve this objective, a computer program was developed by using the Pascal language. The program, with the embedded tabu search algorithm, is able to solve n jobs by m machines job shop scheduling problems. The following thesis can be divided into two parts. The first part is about a survey of literatures concerned with the fundamentals of tabu search for machine scheduling problems. While in the second part, focus is directed to the development of a job shop scheduling program. Having developed the scheduling program, a case study is carried out which makes use of a real life scheduling problem in a manufacturing company and is to be evaluated by using the program designed in this study. Comparison is then made between scheduling results obtained from the program and the actual data obtained from the case. In addition to this real case analyses, some analysis are done on the applicability of the tabu search for the job shop scheduling. It is hope that the findings and experience from this study will benefit future research in the same area.
Rights: All rights reserved
Access: restricted access

Files in This Item:
File Description SizeFormat 
b15554600.pdfFor All Users (off-campus access for PolyU Staff & Students only)2.67 MBAdobe PDFView/Open


Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show full item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/3368