1)  Job-shop
离散生产车间
1.
Job-shop Scheduling System in ASP;
ASP环境下的离散生产车间调度系统
2)  Job Shop
Job shop
1.
Immune Simulated Annealing Hybrid Algorithm and Its Application for Flexible Dynamical Job Shop Scheduling;
免疫模拟退火算法及其在柔性动态Job Shop中的应用
2.
Approach to Job Shop Scheduling Based on Improved Genetic Algorithm;
基于改进遗传算法的Job Shop问题求解
3.
Job sequence perturbation analysis algorithm for Job Shop scheduling problem;
Job Shop 的工件序摄动分析算法
3)  job-shop
非量产
1.
The material management system in job-shop, is based on the different characteristics of machines and combined with auto-dispatching algorithm for job-shop, so that the system can be put in use successfully.
物料管理及自动排程系统把非量产的物料管理和自动调度算法进行结合,同时,考虑了模具加工设备的不同特点,从而使结果达到实用化的程度。
4)  Job-Shop
离散生产类型车间
1.
An evolutionary algorithm for solving the Job-Shop problem is developed by introducing heuristic algorithm mechanism into the genetic algorithm.
通过构造一种新型的与启发式算法相结合的遗传算法,即充分利用启发式算法和遗传算法的优点来解决离散生产类型车间调度问题。
5)  job shop
作业车间
1.
The appliance of wasp colony algorithm to realize dynamic job shop sheduling;
用蜂群算法实现动态作业车间调度
2.
Job Shop Dynamic Scheduling Based on Genetic Algorithm;
基于遗传算法的作业车间动态调度研究
3.
This paper presented a scheduling approach developed to address the scheduling problem of small batch and multiple process routes in job shop environment.
提出一种基于遗传算法的作业计划算法,用于解决作业车间的中小批量多工艺加工作业计划的优化问题。
6)  Job Shop
JobShop
1.
A Job Shop scheduling problem with sequence-dependent setup and weighted tardy penalties is discussed in the paper.
研究调整时间(费用)与工序顺序有关的JobShop调度问题,以最小化总调整费用与总拖期惩罚费用之和为优化目标,通过建立约束规划模型,分析问题的优化特性,实现了基于约束规划的禁忌搜索算法。
2.
An improved adaptive genetic algorithm is proposed to solve a class of combinational scheduling optimization problems——Job Shop scheduling problem.
针对JobShop组合调度优化问题,提出一种改进的自适应遗传算法,该算法在经典遗传算法的基础上增加了重构和局部寻优操作,构造了新的交叉和变异算子,自适应地确定交叉和变异概率,提高了算法的搜索效率。
参考词条
补充资料：离散时间周期序列的离散傅里叶级数表示
    　　 (1)
　　式中χ((n))N为一离散时间周期序列，其周期为N点，即
　　式中r为任意整数。X((k))N为频域周期序列，其周期亦为N点，即X(k)=X(k+lN)，式中l为任意整数。
　　
　　从式(1)可导出已知X((k))N求χ((n))N的关系
　　　(2)
　　式(1)和式(2)称为离散傅里叶级数对。
　　
　　当离散时间周期序列整体向左移位m时,移位后的序列为χ((n+m))N，如果χ((n))N的离散傅里叶级数(DFS)表示为,则χ((n+m))N的DFS表示为
　　

说明：补充资料仅用于学习参考，请勿用于其它任何用途。