Full metadata record
DC FieldValueLanguage
dc.contributorMulti-disciplinary Studiesen_US
dc.contributorDepartment of Computingen_US
dc.creatorLo, Kin-hung-
dc.identifier.urihttps://theses.lib.polyu.edu.hk/handle/200/311-
dc.languageEnglishen_US
dc.publisherHong Kong Polytechnic University-
dc.rightsAll rights reserveden_US
dc.titleSolving a job selection and assignment problem in the legislative control of electrical installationsen_US
dcterms.abstractIn Hong Kong, there are about 60,000 electrical installations subject to the periodic test requirements under the Electricity Ordinance enforced by the Electrical and Mechanical Services Department (EMSD). In order to ensure that the periodic tests of these electrical installations are conducted properly, the test certificates shall be submitted to EMSD for endorsement. Site verification of the periodic tests is a significant part of the endorsement process. However, due to limited resources, only part of the periodic tests would be selected for site verification. The verification job selection process must be effective in maintaining public safety, be fair and lead to efficient use of EMSD resources. The dissertation is to develop the prototype of a computerized system to solve the job selection and assignment problem. The existing problem was studied in details and a number of conflicting constraints were identified. The problem is a Multiple Criteria Decision-Making one. On average, 30 jobs would be selected out of 290 jobs, hence the solution space is 290C30 (i.e. 5.75 x 1040!). This renders exhaustive search for the optimal solution impossible. The tabu search, which is an extended neighborhood search technique, was used to develop the job selection engine. The assignment of the 30 selected jobs to EMSD inspectors would also be handled by tabu search for better efficiency. In view of the limited time, only the constraints due to installation types, contractors, due dates and locations would be considered. The developed prototype consists of a Job Selection Module that handles the first three constraints and a Job Assignment Module that handles the last constraints. The prototype was developed using Visual BASIC, Windows 95 and a PC. After program coding, various sets of test data and life data were used to conduct parametric studies and to verify the program correctness. The solutions generated by the prototype were compared with those generated randomly. The prototype was proved to be much more effective than the existing system, which was based on random generation technique. Even though the prototype could handle the problem successfully, the inherent randomness of tabu search would be a system limitation to the prototype. Hence, repeated running of the system at least three times for a set of data is recommended as a guideline in actual operation. Moreover, a more sophisticated system - interconnected PCs is suggested as the future enhancement of the prototype amongst other recommendations.en_US
dcterms.extentiv, 88 leaves : ill. ; 30 cmen_US
dcterms.isPartOfPolyU Electronic Thesesen_US
dcterms.issued1999en_US
dcterms.educationalLevelAll Masteren_US
dcterms.educationalLevelM.Sc.en_US
dcterms.LCSHProduction scheduling -- Mathematical modelsen_US
dcterms.LCSHSearch theoryen_US
dcterms.LCSHHeuristic programmingen_US
dcterms.LCSHHong Kong Polytechnic University -- Dissertationsen_US
dcterms.accessRightsrestricted accessen_US

Files in This Item:
File Description SizeFormat 
b14605284.pdfFor All Users (off-campus access for PolyU Staff & Students only)2.92 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 simple item record

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