考虑转包的平行机供应链排序

Supply chain scheduling with subcontracting option under parallel machines

研究一类考虑转包的供应链排序问题,即工厂从客户处接受一批订单,这些订单既可以由工厂完成,也可以通过支付一定费用进行转包.工厂需要确定被转包的订单集并安排未被转包订单的生产和运输.针对工厂为平行机生产环境的情况,以交货期限内完成所有订单的转包成本、生产成本与运输成本之和最小化为目标,构建了问题的数学模型,并设计了启发式算法.最后通过数值实验结果表明了算法的有效性.

The supply chain scheduling problem with subcontracting option is studied. In this problem, a plant receives a set of orders from a customer at the beginning of the planning horizon. Each order can either be processed by the plant or be subcontracted at costs. The plant needs to determine which order should be subcontracted, and make production and distribution schedules to all the orders which are produced in-house. The objective is to minimize the total cost, including subcontracting cost, production cost and distribution cost, with the constraint that all the orders which are produced in-house should be finished no more than a given deadline. The mathematical model for the problem is formulated and a heuristic algorithm is developed. Finally, the experiment results show the effectiveness of the proposed algorithm.