Abstract
We study a supply chain scheduling problem in which n jobs have to be scheduled on a single machine and delivered to m customers in batches. Each job has a due date, a processing time and a lateness penalty (weight). To save batch-delivery costs, several jobs for the same customer can be delivered together in a batch, including late jobs. The completion time of each job in the same batch coincides with the batch completion time. A batch setup time has to be added before processing the first job in each batch. The objective is to find a schedule which minimizes the sum of the weighted number of late jobs and the delivery costs. We present a pseudo-polynomial algorithm for a restricted case, where late jobs are delivered separately, and show that it becomes polynomial for the special cases when jobs have equal weights and equal delivery costs or equal processing times and equal setup times. We convert the algorithm into an FPTAS and prove that the solution produced by it is near-optimal for the original general problem by performing a parametric analysis of its performance ratio.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Agnetis, A., Hall, N. G., & Pacciarelli, D. (2006). Supply chain scheduling: sequence coordination. Discrete Applied Mathematics, 154(15), 2044–2063.
Bilgen, B., & Ozkarahan, I. (2004). Strategic tactical and operational production-distribution models: a review. International Journal of Technology Management, 28(2), 151–171.
Brucker, P., & Kovalyov, M. Y. (1996). Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research, 43, 1–8.
Chen, Z.-L. (2008, to appear). Integrated production and outbound distribution scheduling: review and extensions. Operations Research.
Chen, Z.-L., & Hall, N. G. (2007). Supply chain scheduling: conflict and cooperation in assembly systems. Operations Research, 55, 1072–1089.
Chen, Z.-L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51, 614–628.
Dawande, M., Geismar, H. N., Hall, N. G., & Sriskandarajah, C. (2006). Supply chain scheduling: distribution systems. Production and Operations Management, 15(2), 243–261.
Gens, G. V., & Levner, E. V. (1979). Discrete optimization problems and efficient approximate algorithms. Engineering Cybernetics, 17(6), 1–11.
Gens, G. V., & Levner, E. V. (1981). Fast approximation algorithm for job sequencing with deadlines. Discrete Applied Mathematics, 3(4), 313–318.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287–326.
Hall, N. G. (2006). Private communication.
Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: batching and delivery. Operations Research, 51(4), 566–584.
Hall, N. G., & Potts, C. N. (2005). The coordination of scheduling and batch deliveries. Annals of Operations Research, 135, 41–64.
Hochbaum, D. S., & Landy, D. (1994). Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters, 16, 79–86.
Karp, R. M. (1972). Reducibility among combinatorial problem. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum.
Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.
Li, C. L., Vairaktarakis, G., & Lee, C. Y. (2005). Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, 164, 39–51.
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102–109.
Pundoor, G., & Chen, Z.-L. (2005). Scheduling a production-distribution system to optimize the tradeoff between tardiness and total distribution cost. Naval Research Logistics, 52, 571–589.
Sahni, S. K. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116–127.
Selvarajah, E., & Steiner, G. (2006a). Batch scheduling in a two-level supply chain—a focus on the supplier. European Journal of Operational Research, 173(1), 226–240.
Selvarajah, E., & Steiner, G. (2006b). Batch scheduling in customer-centric supply chains. Journal of the Operations Research Society of Japan, 49(3), 174–187.
Selvarajah, E., & Steiner, G. (2009). Approximation algorithms for the supplier’s supply chain scheduling problem. Operations Research. doi:10.1287/opre.1080.0622.
Steiner, G., & Zhang, R. (2007a). Minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. In Proceedings of the 3rd multidisciplinary international conference on scheduling: theory and application (pp. 447–454), Paris, France, 28–31 August.
Steiner, G., & Zhang, R. (2007b). Minimizing the weighted number of late jobs with batch setup times and delivery costs on a single machine. In E. Levner (Ed.), Multiprocessor scheduling: theory and applications (pp. 85–98). Vienna: I-Tech. Publ.
Thomas, D. J., & Griffin, P. M. (1996). Coordinated supply chain management. European Journal of Operations Research, 94, 1–15.
Williams, J. F. (1981). A hybrid algorithm for simultaneous scheduling of production and distribution in multi-echelon structures. Management Science, 29, 77–92.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Steiner, G., Zhang, R. Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains. J Sched 12, 565–574 (2009). https://doi.org/10.1007/s10951-009-0109-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0109-9