Minimizing makespan for server testing with limited resource

Abstract

In recent years, the global competitive circumstance has become more and more drastic. Different strategies such as reducing cost and increase efficiency have been implemented to strengthen their competitiveness. Hence, efficient scheduling method which is proved to bring vantages to the company is usually adapted. In computer server companies, each server should be tested with different software and option cards to prevent confliction between hardware and software. However, different servers require different combinations of option cards in testing and the time of testing will also be based on the type of option card used in testing. Therefore, it will take long time to test a group of computer servers due to limited workforces and option cards. Hence, a developed scheduling program will reduce testing time of computer servers which will result in cost reduction of the company. This paper conducts research in minimizing makspan for computer server testing with limited resource. A mathematical model is developed based on Job Shop scheduling with parallel machine model to provide optimal schedule in computer server testing. Our results shows significant reduction in testing time compared to a real case and the developed model can be applicable for further research. © Springer-Verlag London Limited 2009.