Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016 (2016), Article ID 9315197, 5 pages
http://dx.doi.org/10.1155/2016/9315197
Research Article

Integrated Scheduling of Production and Distribution with Release Dates and Capacitated Deliveries

1Department of Internet Finance and Information Engineering, Guangdong University of Finance, Guangzhou 510520, China
2College of Management and Economics, Tianjin University, Tianjin 300072, China

Received 17 November 2015; Accepted 13 March 2016

Academic Editor: Alexandre B. Dolgui

Copyright © 2016 Xueling Zhong and Dakui Jiang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. G. Hall and C. N. Potts, “Supply chain scheduling: batching and delivery,” Operations Research, vol. 51, no. 4, pp. 566–584, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. N. G. Hall and C. N. Potts, “The coordination of scheduling and batch deliveries,” Annals of Operations Research, vol. 135, no. 1, pp. 41–64, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. Z.-L. Chen and G. L. Vairaktarakis, “Integrated scheduling of production and distribution operations,” Management Science, vol. 51, no. 4, pp. 614–628, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. Z.-L. Chen and G. Pundoor, “Order assignment and scheduling in a supply chain,” Operations Research, vol. 54, no. 3, pp. 555–572, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. M. Ji, Y. He, and T. C. E. Cheng, “Batch delivery scheduling with batch delivery cost on a single machine,” European Journal of Operational Research, vol. 176, no. 2, pp. 745–755, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. C.-L. Li and J. Ou, “Coordinated scheduling of customer orders with decentralized machine locations,” IIE Transactions (Institute of Industrial Engineers), vol. 39, no. 9, pp. 899–909, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. X. Wang and T. C. E. Cheng, “Machine scheduling with an availability constraint and job delivery coordination,” Naval Research Logistics, vol. 54, no. 1, pp. 11–20, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. R. Armstrong, S. Gao, and L. Lei, “A zero-inventory production and distribution problem with a fixed customer sequence,” Annals of Operations Research, vol. 159, pp. 395–414, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. D. K. Jiang and B. Li, “Supply chain scheduling based on hybrid taboo search algorithm,” Journal of Mechanical Engineering, vol. 47, no. 20, pp. 53–59, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. D.-K. Jiang, B. Li, and J.-Y. Tan, “Integrated optimization approach for order assignment and scheduling problem,” Control and Decision, vol. 28, no. 2, pp. 217–222, 2013. View at Google Scholar · View at Scopus
  11. S. Li, X. Zhong, H. Li, and S. Li, “Batch delivery scheduling with multiple decentralized manufacturers,” Mathematical Problems in Engineering, vol. 2014, Article ID 321513, 7 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. C. Viergutz and S. Knust, “Integrated production and distribution scheduling with lifespan constraints,” Annals of Operations Research, vol. 213, no. 1, pp. 293–318, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. C. N. Potts, “Analysis of a heuristic for one machine sequencing with release dates and delivery times,” Operations Research, vol. 28, no. 6, pp. 1436–1441, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  14. L. A. Hall and D. B. Shmoys, “Jackson's rule for single-machine scheduling: making a good heuristic better,” Mathematics of Operations Research, vol. 17, no. 1, pp. 22–35, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. S. Zdrzałka, “Preemptive scheduling with release dates, delivery times and sequence independent setup times,” European Journal of Operational Research, vol. 76, no. 1, pp. 60–71, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. A. Gharbi and M. Haouari, “Minimizing makespan on parallel machines subject to release dates and delivery times,” Journal of Scheduling, vol. 5, no. 4, pp. 329–355, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. M. Mastrolilli, “Efficient approximation schemes for scheduling problems with release dates and delivery times,” Journal of Scheduling, vol. 6, no. 6, pp. 521–531, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. S. Seiden, “Randomized online scheduling with delivery times,” Journal of Combinatorial Optimization, vol. 3, no. 4, pp. 399–416, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  19. J. A. Hoogeveen and A. P. Vestjens, “A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine,” SIAM Journal on Discrete Mathematics, vol. 13, no. 1, pp. 56–63, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. M. van den Akker, H. Hoogeveen, and N. Vakhania, “Restarts can help in the on-line minimization of the maximum delivery time on a single machine,” Journal of Scheduling, vol. 3, no. 6, pp. 333–341, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. I. Averbakh and Z. Xue, “On-line supply chain scheduling problems with preemption,” European Journal of Operational Research, vol. 181, no. 1, pp. 500–504, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  22. I. Averbakh, “On-line integrated production-distribution scheduling problems with capacitated deliveries,” European Journal of Operational Research, vol. 200, no. 2, pp. 377–384, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. J. Fan, “Supply chain scheduling with job's release times on a single machine,” Journal of Systems Science and Mathematical Sciences, vol. 31, no. 11, pp. 1439–1443, 2011. View at Google Scholar · View at MathSciNet
  24. L. Lu, J. Yuan, and L. Zhang, “Single machine scheduling with release dates and job delivery to minimize the makespan,” Theoretical Computer Science, vol. 393, no. 1–3, pp. 102–108, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. P. Liu and X. Lu, “An improved approximation algorithm for single machine scheduling with job delivery,” Theoretical Computer Science, vol. 412, no. 3, pp. 270–274, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  26. Z.-L. Chen, “Integrated production and outbound distribution scheduling: review and extensions,” Operations Research, vol. 58, no. 1, pp. 130–148, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 4, pp. 287–326, 1979. View at Google Scholar
  28. K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, NY, USA, 1974.
  29. J. K. Lenstra, A. H. R. Rinnooy Kan, and P. Brucker, “Complexity of machine scheduling problems,” Annals of Discrete Mathematics, vol. 1, pp. 343–362, 1977. View at Publisher · View at Google Scholar
  30. E. L. Lawler, “Optimal sequencing of a single machine subject to precedence constraints,” Management Science, vol. 19, no. 5, pp. 544–546, 1973. View at Publisher · View at Google Scholar
  31. K. Pruhs, J. Sgall, and E. Torng, “On-line scheduling,” in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, J. Y.-T. Leung, Ed., CRC Press, New York, NY, USA, 2004. View at Google Scholar