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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blazewicz J, Domschke W, Pesch E, The job-shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93(1):1–33, 1996.
Chang PY, Darmadaron P, Melouk S, Minimizing Makespan on Parallel Batch Processing Machines, International Journal of Production Research, 42(19), 4211-4220, 2004.
Cheng TCE, Sin CCS, A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271-292,1990.
Daniels RL, Hoopes BJ, Mazzola JB, Scheduling parallel manufacturing cells with resource flexibility, Management Science, 42, 1260-1276, 1996.
Mark S. Fox and Stephen F. Smith. ISIS: A knowledge-based system for factory scheduling. Expert Systems, 1(1):25–49, 1984.
Hoogeveen JA, van de Velde SL, A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS Journal on Computing, 8: 402–412, 1996.
Karabati S, Kouvelis P, Flow-line scheduling problem with controllable processing times, IIE Transactions, 29, 1-15, 1997.
Pinedo M, Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliff, NJ, USA, 1995.
Sadeh N, Fox MS, Variable and value ordering heuristics for activity-based job-shop scheduling. In Proceedings of the Fourth International Conference on Expert Systems in Production and Operations Management, 1990.
So KC, Some heuristics for scheduling jobs on parallel machines with setups, Management Science, 36, 467-475, 1990.
Tan DS, Gergle D, Mandryk R, Inkpen D, Kellar M, Hawkey D, Czerwinski M, Using job-shop scheduling tasks for evaluating collocated collaboration, Pers Ubiquit Comput, DOI 10.1007/s00779-007-0154-3, 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer London
About this paper
Cite this paper
Chang, PY., Hsu, YT., Cheng, CA. (2009). Minimizing Makespan for Server Testing with Limited Resource. In: Chou, SY., Trappey, A., Pokojski, J., Smith, S. (eds) Global Perspective for Competitive Enterprise, Economy and Ecology. Advanced Concurrent Engineering. Springer, London. https://doi.org/10.1007/978-1-84882-762-2_36
Download citation
DOI: https://doi.org/10.1007/978-1-84882-762-2_36
Publisher Name: Springer, London
Print ISBN: 978-1-84882-761-5
Online ISBN: 978-1-84882-762-2
eBook Packages: EngineeringEngineering (R0)