全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

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

DOI: 10.1155/2014/163637

Full-Text   Cite this paper   Add to My Lib

Abstract:

In the classical production-distribution centers problem, only assignment of customers, distribution centers, and suppliers is determined. This paper extends the problem of production-distribution centers assignment by considering sequencing decisions in the supply network. Nowadays, meeting delivery time of products is a competitive benefit; therefore, the objective is to minimize total tardiness. This problem is mathematically formulated by a mixed integer programming model. Then, using the proposed model, small instances of the problem can be optimally solved by GAMS software. Moreover, two metaheuristics based on variable neighborhood search and simulated annealing are proposed to solve large instances of the problem. Finally, performance of the proposed metaheuristics is evaluated by two sets of balanced and unbalanced instances. The computational results show the superiority of the variable neighborhood search algorithm. 1. Introduction In the supply chain, various organizations work together for converting raw materials to finished products and are connected with each other over far distances. The customer orders due date and the short life-cycle products need agile supply networks. To accelerate supply chain operations many activities such as keeping storage which are nonvalue added activities must be eliminated. It also should be stated that customer demands are generating the flow of supply network and they have to be specified or predicted in advance, but optimization of this flow through the network for minimizing the costs is an important purpose of the supply chain and, for optimizing, speed of the sources and capacity limitations are considered. Scheduling for order shipment to the customer destinations and using transportation means, in order to pick up the orders at the distribution centers (DCs) were done just by staff experiences. This will increase not only the waiting time of transportation means, but also accumulation of the orders and inventory costs. Ultimately delivery time of the orders will exceed the due date and cause penalty costs and dissatisfaction of the customers. The model which is proposed in this paper presents a good solution for the above situation. It offers a good method for calculating the time of production or packing in the plants and distribution centers and the transportation between them to decrease the delivery time of the orders and define an optimal assignment and sequence for the customers according to the capacity of distribution centers and customer due dates. As regards the importance of scheduling

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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133