Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 247356, 6 pages
http://dx.doi.org/10.1155/2015/247356
Research Article

Parallel Machine Scheduling with Batch Delivery to Two Customers

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 1 May 2015; Revised 22 August 2015; Accepted 31 August 2015

Academic Editor: Sergio Teggi

Copyright © 2015 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. 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 Scopus
  2. Y.-C. Chang and C.-Y. Lee, “Machine scheduling with job delivery coordination,” European Journal of Operational Research, vol. 158, no. 2, pp. 470–487, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. C.-L. Li and G. Vairaktarakis, “Coordinating production and distribution of jobs with bundling operations,” IIE Transactions, vol. 39, no. 2, pp. 203–215, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. C. A. Ullrich, “Integrated machine scheduling and vehicle routing with time windows,” European Journal of Operational Research, vol. 227, no. 1, pp. 152–165, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. G. J. Woeginger, “Heuristics for parallel machine scheduling with delivery times,” Acta Informatica, vol. 31, no. 6, pp. 503–512, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, Calif, USA, 1979. View at MathSciNet
  7. M. Pinedo, Scheduling: Theory, Aglorithms, and Systems, Springer, New York, NY, USA, 2012. View at Publisher · View at Google Scholar · View at MathSciNet