论文部分内容阅读
讨论 Job shop排序问题不可行解的构造情况 ,给出了不可行解的一个充要条件以及 2台机器n个加工工件的 Job shop问题不可行解和可行解的计算公式 ,并由此得到一种概率模型的计算方法。通过计算发现 ,Job shop排序问题的不可行解所占比例非常大
The construction of the infeasible solution to Job shop scheduling problem is discussed. A necessary and sufficient condition of infeasible solution and the infeasible solution of Job shop problem and the solution formula of two infeasible jobs are given. Calculation Method of Probability Model. The calculation shows that the proportion of infeasible solutions to Job shop scheduling problem is very large