带有乘积型多目标权函数的调度谈判问题

在供应链环境下的生产活动中,各成员对所辖资源具有独立的支配权,因此需要合理的机制使得协同调度方案得以实施,以提高供应链整体的效率.研究由具备不同讨价还价能力的成员所组成的供应链,建立了以纳什讨价还价公理体系为基础的调度谈判模型.在装配系统中,讨论两供应商关于交付顺序的协商.为求取纳什谈判解,提出了一类新的以多目标乘积项作为目标函数的调度问题.对于单机型供应商,新问题的计算复杂性尚未确定,设计了一种多项式时间的启发式算法以求得近优解,并通过数值算例进行验证.该谈判模型为供应链中各成员提供了一种合理的调度协调机制.

Scheduling Bargaining Problem with Multi-Objective Product

In supply chain manufacturing,cooperation improves the efficiency a lot.On the basis of the Nash bargaining axioms systems,a bargaining model was established to analyze the negotiation between two schedulers with equal autonomy.Under assembly scheduling circumstance,we investigated the bargaining about suppliers delivery sequence.A new multi-objective scheduling problem was set up to find the Nash bargaining solution.Since its computational complexity was still open,we developed a polynomial time heuristic to find a near optimal solution.Numerical instances validated the efficiency.The bargaining model proposed provides a rational mechanism for cooperation between self-seeking participants.