Full metadata record
|dc.contributor||Department of Applied Mathematics||en_US|
|dc.creator||Lee, Chi-kit Curie||-|
|dc.publisher||Hong Kong Polytechnic University||-|
|dc.rights||All rights reserved||en_US|
|dc.title||Mathematical modelling for services scheduling||en_US|
|dcterms.abstract||Services Scheduling could be very crucial in many industries as manufacturers have to provide effective after-sales services. In this paper, I will formulate the problem of the technician scheduling as different mathematical models. In the first part, I will formulate a basic model and solve the problem with a simple algorithm. In the second past, I will formulate the model again as a multiple travelling salesman problem (MTSP) and solve it with a modified Branch and Bound method. The results of the first two models will be computed and comparison will be given. The results show that both models give same results and the MTSP model with the modified Branch and Bound works faster and it is also practical to work on the exact algorithm due to the advanced computational tools (powerful computer hardware and software development). Lastly, formulation of the problem as a Vehicle Routing Problem (VRP) and solve it by Lagrangian optimization and other models are also discussed.||en_US|
|dcterms.extent||132 leaves : ill. ; 30 cm||en_US|
|dcterms.LCSH||Production scheduling -- Mathematical models||en_US|
|dcterms.LCSH||Hong Kong Polytechnic University -- Dissertations||en_US|
Files in This Item:
|b14799212.pdf||For All Users (off-campus access for PolyU Staff & Students only)||4.08 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- 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.
- 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.
Please use this identifier to cite or link to this item: