Table of Contents
ISRN Industrial Engineering
Volume 2014, Article ID 163637, 12 pages
http://dx.doi.org/10.1155/2014/163637
Research Article

Production Scheduling and Customer Orders Assignment in a Three-Level Supply Chain

1South Branch of Islamic Azad University, School of Industrial Engineering, Kafaee Amani Street, Gerami Street, Enghelab Avenue, Tehran 1151863411, Iran
2Kharazmi University, Daneshgah Square, Shahid Beheshti Avenue, Karaj 3197937551, Iran

Received 27 September 2013; Accepted 23 November 2013; Published 28 January 2014

Academic Editors: T. F. Espino-Rodriguez and C.-C. Wu

Copyright © 2014 F. Sadeghi Naieni Fard et al. 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. S. H. Zegordi and M. A. Beheshti Nia, “A multi-population genetic algorithm for transportation scheduling,” Transportation Research E, vol. 45, no. 6, pp. 946–959, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. S. H. Zegordi, I. N. K. Abadi, and M. A. B. Nia, “A novel genetic algorithm for solving production and transportation scheduling in a two-stage supply chain,” Computers and Industrial Engineering, vol. 58, no. 3, pp. 373–381, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. K. Li, A. I. Sivakumar, and V. K. Ganesan, “Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain,” European Journal of Operational Research, vol. 187, no. 2, pp. 442–455, 2008. View at Publisher · View at Google Scholar · View at Scopus
  4. K. Li, V. K. Ganesan, and A. I. Sivakumar, “Scheduling of single stage assembly with air transportation in a consumer electronic supply chain,” Computers and Industrial Engineering, vol. 51, no. 2, pp. 264–278, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. M. Zandieh and S. Molla-Alizadeh-Zavardehi, “Synchronizing production and air transportation scheduling using mathematical programming models,” Journal of Computational and Applied Mathematics, vol. 230, no. 2, pp. 546–558, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. D. Naso, M. Surico, B. Turchiano, and U. Kaymak, “Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete,” European Journal of Operational Research, vol. 177, no. 3, pp. 2069–2099, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. B. Chen and C.-Y. Lee, “Logistics scheduling with batching and transportation,” European Journal of Operational Research, vol. 189, no. 3, pp. 871–876, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. 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 Scopus
  9. S. A. Mansouri, “A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain,” Computers and Industrial Engineering, vol. 50, no. 1-2, pp. 105–119, 2006. View at Publisher · View at Google Scholar · View at Scopus
  10. C.-J. Liao, C.-C. Shyu, and C.-T. Tseng, “A least flexibility first heuristic to coordinate setups in a two- or three-stage supply chain,” International Journal of Production Economics, vol. 117, no. 1, pp. 127–135, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. Z. Sevkli and F. E. Sevilgen, “variable neighborhood search for the orienting problem,” in Lecture Notes in Computer Science, vol. 4263, pp. 134–143, Springer, 2006. View at Google Scholar
  12. R. Tavakkoli-Moghaddam, N. Safaei, and Y. Gholipour, “A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length,” Applied Mathematics and Computation, vol. 176, no. 2, pp. 445–454, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Parthasarathy and C. Rajendran, “A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs—a case study,” Production Planning and Control, vol. 8, no. 5, pp. 475–483, 1997. View at Google Scholar · View at Scopus