Abstract
In this chapter, we present computational experiments to evaluate the performance of the decomposition procedures developed in the previous chapter. The procedures are used to solve a large number of randomly generated problems based on data obtained from a major semiconductor company. These results indicate that the tailored decomposition procedures DEC and DECwR significantly outperform both myopic and extended dispatching rules both on average and in the worst case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ovacik, I.M., Uzsoy, R., “Rolling Horizon Procedures for Dynamic Parallel Machine Problems with Sequence Dependent Setup Times”, International Journal of Production Research 33, 3173–3192 (1995).
Uzsoy, R., Church, LK., Ovacik, I.M., Hinchman, J., “Performance Evaluation of Dispatching Rules for Semiconductor Testing Operations”, Journal of Electronics Manufacturing 3, 95–105 (1993).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ovacik, I.M., Uzsoy, R. (1997). Computational Results for Shops with Single and Parallel Machine Workcenters. In: Decomposition Methods for Complex Factory Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6329-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6329-7_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7906-5
Online ISBN: 978-1-4615-6329-7
eBook Packages: Springer Book Archive