可行序列 meaning in Chinese

feasible sequence

A feasible sqp algorithm with superlinear convergence for inequality constrained optimization
不等式约束优化一个具有超线性收敛的可行序列二次规划算法
The main idea of this hybrid algorithm is : at first , all candidates in task collection is lined according to a dispatching rule ( earliest due date , edd ) , then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier , many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier , the allocation of the resources over time is conducted to perform every feasible task sequence , and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed
该算法按照最早完工时间优先( ect )分派规则,先将参加排序的工序合并成一个串行序列,然后按照同层内不存在偏序关系的原则,将其分解为若干个时间上相互衔接的层次,在每个层次内部,通过构造邻域产生出多个可行序列,对每个可行序列进行设备配置,采用邻域搜索算法进行方案的寻优,保留一组满足评价要求的可行方案作为下一层设备配置的背景环境,通过层层递进最终获取全局的近似最优解。