A zero-inventory production and distribution problem with a fixed customer sequence

Annals of Operations Research

Volumn 159, Issue 1, 2008, Pages 395-414

  Armstrong, Ronald ^a   Gao, Su ^b   Lei, Lei ^a  

^a RUTGERS UNIVERSITY   (United States)

^b CLARK ATLANTA UNIVERSITY   (United States)

Author keywords

Branch and bound search procedure; Heuristic lower bound; Product lifespan; Time windows; Zero inventory production and distribution problem

Indexed keywords

EID: 38749150380     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0272-3     Document Type: Article

References (18)

1. Chen, Z. L. (2002). Integrated production and distribution operations: Taxonomy, models, and review. In Supply chain analysis in the e-business era. Dordrecht: Kluwer Academic.
2. Cheng, T. C. E., & Gordon, V. S. (1994). On batch delivery scheduling on a single machine. Journal of the Operational Research Society, 45, 1211-1216.
3. Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operations Research, 94, 277-283.
4. Cheng, T. C. E., Kovalyov, M. Y., & Lin, B. M.-T. (1997). Single machine scheduling to minimize batch delivery and job earliness penalties. SIAM Journal of Optimization, 7, 547-559.
5. Dueck, G., & Scheuer, T. (1990). Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90, 161-175.
6. Geismar, N., Laporte, G., Lei, L., & Sriskandarajah, C. (2007, in press). The integrated production and transportation scheduling problem with expiring product and non-instantaneous transportation time. INFORMS Journal on Computing.
7. Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51(4), 566-584.
8. Hall, L., & Shmoys, D. (1989). Approximation schemes for constrained scheduling problems. In Proceedings of the 30th annual symposium on foundations of computer science (Vol. 30, pp. 134-140).
9. Hurter, A. P., & Van Buer, M. G. (1996). The newspaper production/distribution problem. Journal of Business Logistics, 17, 85-107.
10. Lee, C.-Y., & Chen, Z.-L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3-24.
11. Pinedo, M. (1995). Scheduling: Theory, algorithms, and systems. New York: Prentice Hall.
12. Potts, C. N. (1980). An analysis of a heuristic for one machine sequencing with release dates and delivery time. Operations Research, 28, 1436-1441.
13. Tarantilis, C. D., & Kiranoudis, C. T. (2001). A meta-heuristic algorithm for the efficient distribution of perishable foods. Journal of Food Engineering, 50, 1-9.
14. Van Buer, M. G., Woodruff, D. L., & Olson, R. T. (1999). Solving the medium newspaper production/distribution problem. European Journal of Operations Research, 115, 237-253.
15. Wang, G., & Cheng, T. C. E. (2000). Parallel machine scheduling with batch delivery costs. International Journal of Production and Economics, 68, 177-183.
16. Woeginger, G. J. (1998). Polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times. Journal of Scheduling, 1, 79-87.
17. Yuan, J. A. (1996). A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs. European Journal of Operational Research, 94, 203-205.
18. Zdrzalka, S. (1995). Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times. European Journal of Operational Research, 80, 371-380.