jssp meaning in Chinese
车间作业调度
作业调度问题
Examples
- It has been proven in theory that the jssp is a classical np - hard
在理论上已经证明， jssp是一个np难题。 - Also , we put special emphasis on deadlock problems since deadlock is a big obstacle to ga - based jssp solutions
特别地，在将ga应用于jssp的过程中，死锁问题是讨论的重点，死锁的消除是用ga解决jssp的前提。 - Meanwhile , the changeability of market demand together with the uncertainty in a real job shop adds to the complexity of jssp
同时，实际车间中的各种动态事件难以预测，以致车间调度问题异常复杂，迄今为止还没有一种通用有效的调度策略。 - Based on the model , we implemented an effective and widely applicable prototype system for dynamic jssps . the first part of the paper introduces the background , the categories and the development of job shop scheduling
首先，本文介绍了车间调度的背景、类型和研究发展状况，并分析了ga和mas在解决jssp这类np - hard问题方面的前景。 - Meanwhile , the promising aspects of ga and mas for solving np - hard problems are highlighted . the second chapter analyses in detail how to adapt ga for jssp , and compares the performances of the ga in binary coding and decimal coding
接着本文详细探讨了将ga运用在车间调度问题( jobshopschedulingproblem ， jssp )中的关键技术，同时对比了二十进制编码方案的性能。