现实活动中，存在大量的需要由多人合作才能完成某项工作的情况．针对两人合作共同加工一批工件，每人有一台加工机器，每个工件只需加工一次，工件加工时间是开工时间的线性函数的问题建立数学模型，考虑以最小的最大流程时间作为加工成本，确定这批工件的一个划分，把工件分配给两台机器加工．该划分方案不仅考虑到合作双方的效率，而且充分体现公平性原则，从而使双方对相应的合作（加工）收益分配满意，愿意合作．%In the real world, there exist many situation where many persons need cooperate in order to complete a project. We establish a mathematical model of the problem where two persons process a batch of jobs by cooperation. Each person offers a single machine and each job with linear processing time of its starting time just needs to be processed once. If we define the minimized maximum flow time as a processing cost, determine a division of these jobs which not only considers the efficiency of each person but also embodies the fairness principle, to yield a reasonable cooperative (processing)profit allocation scheme acceptable to them.
展开▼
