摘要
针对多个具有不同交货期的生产任务共享有限制造资源的情况，建立了具有明确工程背景的问题描述，并证明了问题有可行解的充分必要条件，建立了判别这些条件的工程实用计算算法。这一算法能够快速提供有效信息，便于在企业报价员与客户进行谈判时，可对客户提出的任务交货期进行正确决策。
Abstract In this paper, a problem of rough capacity estimation for orders production is described which is based upon finite and share manufacturing resources. Then, the necessary and sufficient condition is put forward and proved on the existence of feasible solution to this problem. In order judge if this problem has feasible solution, an engieering algorithm, which is very easy to execute, is set up and analyzed. This algorithm can greatly accelerate the engineerign calculation procedure and provide useful information in time. This information can support the negotiator to make correct decision on the due time of orders when he (she) is bargaining with the users.
出处
《工程数学学报》
CSCD
北大核心
1999年第2期80-88,共9页
Chinese Journal of Engineering Mathematics
基金
国家863/CIMS跟踪课题
广东省自然科学基金
