1) Flow-shop scheduling problem
流水作业调度问题
1.
Flow-shop scheduling problem is known to be notoriously intractable, both in theory and practice.
流水作业调度问题在理论和实践方面均是一个著名的难题。
2) Flow shop scheduling problem
流水线调度问题
1.
Simulated annealing(SA) algorithm is one of the commonly used approaches in solving flow shop scheduling problems(FSPs).
对于大规模流水线调度问题(FSP),模拟退火算法(SA)中邻域候选解的被接受概率,因邻域增大和邻域中的劣解数的增多而大大降低,SA算法的性能因而大为降低。
3) stochastic job shop scheduling probelm
随机作业调度问题
4) job-shop scheduling problem
车间作业调度问题
1.
The ASP was treated as a particular job-shop scheduling problem(JSP),and an ant colony algorithm(ACA) for the ASP was designed with the objective of minimizing the makespan of landing airplanes.
本文首先将ASP表示成一个特殊的车间作业调度问题(JSP),以减少着陆飞机队列完成时间为优化目标,设计了求解ASP的蚁群算法。
2.
Aiming at these limitations, an improved algorithm called Grafting-Symbiosis Genetic Algorithm (GSGA) is developed for job-shop scheduling problem.
针对现有遗传算法在解决复杂车间作业调度问题时存在早熟和进化速度缓慢的缺点,提出了一种改进的算法———嫁接共生遗传算法。
3.
In this paper,we propose the modified genetic algorithm with search area adaptation(mGSA) for solving the Job-shop scheduling problem(JSP).
文章阐述了一种改进的搜索空间适应性的遗传算法(mGSA)用于解决车间作业调度问题(JSP);这种方法不同于GSA不需要带特征继承率调节能力的交叉操作。
5) job shop scheduling problem
作业车间调度问题
1.
Hybrid QPSO algorithm for job shop scheduling problems
求解作业车间调度问题的混合QPSO算法
2.
The paper designed an enhanced simulated annealing algorithm(ESA) with back jump tracking in connection with the critical path theory of a job shop scheduling problem.
结合作业车间调度问题的关键路径理论,设计了一种具有多次退火过程的调度算法。
3.
A discrete Particle Swarm Optimization(PSO) algorithm was presented for Job Shop scheduling problem.
提出了用于解决作业车间调度问题的离散版粒子群算法。
6) Job Shop Scheduling Problem(JSP)
作业车间调度问题(JSP)
补充资料：流水作业
一种生产组织方式，把整个的加工过程分成若干不同的工序，按照顺序像流水似地不断进行。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条