Home            Contact us            FAQs
    
      Journal Home      |      Aim & Scope     |     Author(s) Information      |      Editorial Board      |      MSP Download Statistics

     Advance Journal of Food Science and Technology


A Novel Rescheduling Model for Agricultural Food Products Management in Cross-Border Electronic Commerce

Man Su
School of Foreign Studies, Yiwu Industrial and Commercial College, Yiwu 322000, China
Advance Journal of Food Science and Technology   2016  8:626-630
http://dx.doi.org/10.19026/ajfst.10.2195  |  © The Author(s) 2016
Received: August ‎8, ‎2015  |  Accepted: September ‎3, ‎2015  |  Published: March 15, 2016

Abstract

This study aims to investigate the rescheduling model for agricultural food products management in cross-border electronic commerce using logistic chain theory. Agricultural products chain scheduling in cross-border electronic commerce manages and controls the project progress through critical chain identification and buffer insertion but suffers from left-extension problem. To solve this issue, a new rescheduling model for agricultural food products management in cross-border electronic commerce using logistic chain theory is proposed in this study. In the new rescheduling model, the critical logistic chain was adopted to reschedule the plan with left-extension. Then the influence factors in the chain were analyzed to evaluate their effects on the left-extension. By doings so, a reasonable rescheduling model was established for managing the agricultural products critical chain. Numerical validation has been carried out in this study to examine the performance of the proposed rescheduling model. The analysis results indicate that the proposed rescheduling model could solve the left-extension problem in the agricultural products critical chain and hence is useful for practical application in cross-border electronic commerce.

Keywords:

Agricultural food, cross-border electronic commerce, logistic chain, logistic chain,


References

  1. Cheng, X. and C. Wu, 2006. Hybrid algorithm for complex project scheduling. Comp. Integr. Manuf. Syst., 12(4): 585-589.
  2. Cui, N., W. Tian and L. Bie, 2010. Rescheduling after inserting the buffer in the critical chain scheduling. Proceedings of the International Conference on Logistics Systems and Intelligent Management, Harbin, China, January 9-10.
    CrossRef    
  3. Goldratt, E., 1997. Critical Chain. The North River Press, New York.
  4. Herroelen, W. and R. Leus, 2001. On the merits and pitfalls of critical chain scheduling. J. Oper. Manag., 19(5): 559-577.
    CrossRef    
  5. Mendes, J., J. Goncalves and M. Resende, 2009. A random key based genetic algorithm for the resource constrained project scheduling problem. Comp. Oper. Res., 36(1): 92-109.
    CrossRef    
  6. Peng, W. and C. Wang, 2010. Critical chain model project scheduling based model and its GA solution. J. Syst. Eng., 25(1): 123-131.
  7. Rabbani, M., G. Fatemi, F. Jolai and N. Lahiji, 2007. A new heuristic for resource constrained project scheduling in stochastic networks using critical chain concept. Europ. J. Oper. Res., 176(2): 794-808.
    CrossRef    
  8. Tian, W. and N. Cui, 2009. Identifying the critical chain and non-critical chain in the critical chain project management. Indus. Eng. Manag., 14(2): 88-93.

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.

ISSN (Online):  2042-4876
ISSN (Print):   2042-4868
Submit Manuscript
   Information
   Sales & Services
Home   |  Contact us   |  About us   |  Privacy Policy
Copyright © 2024. MAXWELL Scientific Publication Corp., All rights reserved