Abstract
In this paper, we consider a two-identical-parallel-machine scheduling problem with batch delivery. Although NP-hardness of this problem has been already proved by Hall and Potts, but they did not give the pseudo-polynomial-time algorithm for the problem. We prove the problem is NP-hard in the ordinary sense by constructing a pseudo-polynomial-time algorithm for the problem. We also give a polynomial-time algorithm to solve the case when the job assignment to parallel machines is given.
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
Chang, Y.-C., Lee, C.-Y.: Machine Scheduling with Job Delivery Coordination. European Journal of Operational Research 158, 470–487 (2004)
Hall, N.G., Lesaoana, M.A., Potts, C.N.: Scheduling with Fixed Delivery Dates. Operations Research 49, 854–865 (2001)
Hall, N.G., Potts, C.N.: Supply Chain Scheduling: Batching and Delivery. Operations Research 51, 566–584 (2003)
Hall, N.G., Potts, C.N.: The Coordination of Scheduling and Batch Deliveries. Annals of Operations Research 135, 41–64 (2005)
He, Y., Zhong, W., Gu, H.: Improved Algorithms for Two Single Machine Scheduling Problems. Theoretical Computer Science 363, 257–265 (2006)
Kovalyov, M.Y., Kubiak, W.A.: A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. Journal of Heuristics 3, 287–297 (1998)
Lee, C.-Y., Chen, Z.-L.: Machine Scheduling with Transportation Considerations. Journal of Scheduling 4, 3–24 (2001)
Wang, G.Q., Cheng, T.C.E.: Parallel Machine Scheduling with Batch Delivery Costs. International Journal of Production Economics 68, 177–183 (2000)
Zhong, W., Dsa, G., Tan, Z.: On the Machine Scheduling Problem with Job Delivery Coordination. European Journal of Operational Research 182, 1057–1072 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gong, H., Tang, L. (2008). The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)