Order acceptance exists in production management, however, the influences of buffers on order acceptance have not been considered in existing order acceptance in multi-nodes. To study this problem, an order acceptance model is set up based on multi-nodes production of buffers constraints. The hybrid algorithm with improved NEH algorithm, discrete harmony search and variable neighborhood search is proposed for solving the model. Experiments show that when the size of problem is small, good results are abtained and when the size of problem is large, general results are obtained. Completion time of order is less affected by the size of buffer and is similar to results of unlimited buffer. The computation speed of hybrid algorithm is better than other algorithms. The hybrid algorithm can solve the model.
WANG Lei, XU Shao-yun, ZHAO Yang, ZHAO Qiu-hong
. Model and Algorithm for Order Acceptance on Multi-node Production Environment with Limited Buffer[J]. Chinese Journal of Management Science, 2015
, 23(12)
: 135
-141
.
DOI: 10.16381/j.cnki.issn1003-207x.2015.12.016
[1] Ono K, Jones C H. An heuristic approach to acceptance rules in integrated scheduling systems[J].Journal of Operations Research Society of Japan,1973,16 (1):36-58.
[2] Senju S, Toyoda Y. An approach to linear programming with 0-1 variables[J]. Management Science,1968,15 (4):196-207.
[3] Jain S K, Stott K L, Vasold E G. Order book balancing using a combination of linear programming and heuristic techniques[J].Interfaces,1978,9 (1):55-67.
[4] Pourbabi B. A short term production planning and scheduling model[J]. Engineering Costs and Production Economics,1989,18(2):159-167.
[5] Pourbabi B. Optimal selection of orders in a just-in-time manufacturing environment:A loading model for a computer integrated manufacturing system[J]. International Journal of Computer Integrated Manufacturing,1992,5 (1):3-44.
[6] Kolisch R. Integrated production planning, order acceptance, and due date setting for make-to-order manufacturing[M]//Kischka P,Derigs U,Domschke W,et al.Operations Research Proceedings Berlin, Heidelberg:Springer-verlag 1997, 1998:492-497.
[7] Roundy R, Chen D, Chen Pan, et al. Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system:Models and algorithms[J].IIE Transactions, 2005, 37(12):1093-1105.
[8] 张欣,马士华.基于有限生产能力和产出缓存的订单接收策略[J].工业工程与管理,2008,13(2):34-38.
[9] 肖依永,常文兵,张人千.多生产线且多节点环境下的订单选择模型[J].工业工程与管理,2008,13(6):26-31.
[10] Mestry S, Damodaran P, Chen C S. A branch-and-price solution approachfor order acceptance and capacity planning in make-to-order operations[J]. European Journal of Operational Research,2011,211(3):480-495.
[11] 肖依永,常文兵,张人千.基于模拟退火算法的多节点订单排序模型[J].计算机应用研究,2009,26 (2):460-465.
[12] Xiao Yiyong, Zhang Renqian, Zhao Qiuhong, et al. Permutation flow shop scheduling with order acceptance and weighted tardiness[J].Applied Mathematics and Computation, 2012, 218(15):7911-7926.
[13] Wang Xiuli, Xie Xingzi, Cheng T C E.A modified artificial bee colony algorithm for order acceptance in two-machine flow shops[J]. International Journal of Production Economics, 2013,141(1):14-23.
[14] Framinan J M, Leisten R. An efficient constructive heuristic for flowtime minimization in permutation flow shops[J]. Omega, 2003,31(4):311-317.
