Abstract
For the m-machine Flow Shop Weighted Completion Time problem, a New Lower Bound (NLB) is derived to improve the original lower bound which was given by Kaminsky and Simchi-Levi. 1) For the case of arbitrary weight, the NLB is asymptotically equivalent to the optimality solution, as the total number of jobs goes to infinity. Specially, when the processing times of jobs are all equal, the NLB is just the optimal solution. 2) For the case of equal-weight, a tight worst case performance ratio of the optimal solution to the NLB is obtained. At the end of the paper, computational results show the effectiveness of NLB on a set of random test problems.
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
Bhaskaran, K., Pinedo, M.: Dispatching. In: Salvendy, G. (ed.) Handbook of industrial engineering, Wiley, New York (1992)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Kaminsky, P., Simchi-Levi, D.: Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem. Operations Research 46, 872–882 (1998)
Kaminsky, P., Simchi-Levi, D.: The asymptotic optimality of the SPT rule for the flow shop mean completion time problem. Operations Research 49, 293–304 (2001)
Kohler, W., Steiglitz, K.: Exact, approximate, and guaranteed accuracy algorithms for the flow shop problem [graphics object to be inserted manually]. Journal of the Association of Computer Machinery 22, 106–114 (1975)
Pinedo, M.: Scheduling: Theory, Algorithms and Systems. Prentice-Hall, Englewood Cliffs, New Jersey (1995)
Shakhlevich, N., Hoogeveen, H., Pinedo, M.: Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling 1, 157–168 (1998)
Xia, C.H., Shanthikumar, J.G., Glynn, P.W.: On the asymptotic optimality of the SPT rule for the flow shop average completion time problem. Operations Research 48, 615–622 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, D., Tang, L. (2007). Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)