Abstract
The problem of batch scheduling is discussed and the complexity of minimizing the total weighted completed time which is named the problems 1|B, r j ∈ {0, r}| ∑ ω j C j is analyzed in this paper. On this basic the NP-completeness of the problem was proved. Then a class of special case of the problem is researched and an improved approximated algorithm is proposed. Finally the analysis and proof to the new algorithm showed that it was feasible and it decreased the computing complexity by about 0.5 times.
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
Bruker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Tautenhahn, T.: Scheduling Batching Machine. Journal of Sheduling 1, 31–54 (1998)
Ahmadi, H., Ahmadi, R.H., Dasu, S., Tang, C.S.: Batching and Scheduling Job Shop on Batch and Discrete Processors. Operations Research 39(4), 750–763 (1992)
Albers, Brucker, P.: The Complexity of One-machine Batching Problem. Discrete Applied Mathematics 47, 87–107 (1993)
Chandru, V., Lee, C.Y., Uzsoy, R.: Minimizing Total Completion Time on a Batch Processing Machine. International Journal of Production Research 31, 2097–2121 (1993)
Chandru, V., Lee, C.Y., Uzsoy, R.: Minimizing Total Completion Time on a Batch Processing Machine with Job Families. Operations Research Letters 13, 61–65 (1993)
Poon, C.K., Yu, W.C.: On Minimizing Total Completion Time in Batch Machine Scheduling. International Journal of Foundations of Computer Science 15(4) (2004)
Hochbaum, D.S., Landy, D.: Scheduling Semiconductor Burn-in Operations to Minimize Total Flowtime. Operations Research 45(6), 874–885 (1997)
Deng, X., Zhang, Y.: Minimizing Mean Response Time in Batch Processing System. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 231–240. Springer, Heidelberg (1999)
Miao, C.X., Zhang, Y.Z.: Minimizing the Total Weighted Completed Time on Batch Processing Machines. Or Transactions 9(2), 81–86 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Zhang, B., Cai, Z., Li, Z. (2011). An Improved Approximation Algorithm for a Class of Batch Scheduling Problems. In: Huang, DS., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing. ICIC 2011. Lecture Notes in Computer Science, vol 6838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24728-6_82
Download citation
DOI: https://doi.org/10.1007/978-3-642-24728-6_82
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24727-9
Online ISBN: 978-3-642-24728-6
eBook Packages: Computer ScienceComputer Science (R0)