An integrated job release and scheduling approach on parallel machines: An application in electric wire-harness industry

This paper presents a new job release (JR) and scheduling methodology for one-stage parallel machines where sequence dependent setup times exist. A decision support system (DSS) based on job release is developed in order to enable the application of the methodology. First, mathematical programming models for both job release and job scheduling are devised. Then, due to the NP-hard nature of the problems, heuristics are proposed. As for the interaction between JR and scheduling, job scheduling is integrated with job release for the proposed heuristic solutions so that the capacity achievement provided by scheduling can be utilized for job release. In brief, product design characteristics oriented scheduling affects JR in the proposed approach. Moreover, value stream mapping (VSM) approach is used with the aim of stating the effect of the proposed methodology. Furthermore, the presented methodology was applied in a real life electric wire-harness production system. The application, based on 120-day production data, revealed that the proposed methodology provided 25% decrease in in-plant manufacturing lead time.     

基于安全性能接口的调度和管理模型研究

以云计算效能提高为目的, 以研究Job调度和资源管理两大决定云计算环境能效的最重要因素为基础, 使用调度和管理对象对作为系统统计信息的参考指标进行采集的方式展开研究。性能代理和服务接口模式(PASI)已经从云环境中采集了原始数据, 通常情况下应用于云的安全技术属于被动防御模式, 如实时动态监控或者深度包检测模式(DPI), 其主要目的是实现动态检测和防御。提出了一个有效的框架以提高云计算中心的综合性能指标, 该架构的建立是基于PASI与DPI相结合的方式, 并且提出了一个基于安全PASI的Job调度和资源管理模型(JDRMSP)。实验结果表明, 该模型有效地提升了云环境的整体运作效能。     

求解Job Shop调度问题的自适应遗传算法设计

针对标准遗传算法中交叉概率Pc和变异概率Pm固定不变带来的局限性,以及M.Sr-invivas自适应遗传算法的缺点,提出了根据适应值集中程度,自适应地变化整个种群的Pc和Pm的一种改进的自适应遗传算法,文中系统地介绍了算法的改进及算法的流程,并将算法应用于求解JSP问题,最后用一个典型的测试例子,对本文设计的算法的求解效果进行了测试,并对测试结果进行了分析.     

基于ILOG平台的求解动态车间作业调度问题优化算法研究

研究了基于约束规划和启发式搜索算法结合求解动态车间作业调度的问题。以最小化制造周期费用与总拖期惩罚费用之和为优化目标,通过建立调度模型、分析问题的优化特性,提出了基于约束规划的禁忌搜索启发式算法,根据与另外两种算法的比较结果,验证了此算法的有效性。     

TS/MP混合算法求解作业车间JIT调度问题

针对作业车间准时制生产调度这类典型的非正规性能指标调度问题,采用禁忌搜索和数学规划的混合策略进行求解,即在每一迭代搜索过程中,首先由禁忌搜索得到各机器上的工序加工序列,再调用数学规划方法来优化各工序的开工时间。另外,设计了一种包含交换和插入两种移动操作的邻域构造方法。邻域构造方法通过交换相邻加工工序对来在当前解的邻域内寻优,而将目标工序插入块之间的间隙以解除块对相关工序的束缚,这种邻域结构有助于提高禁忌搜索求解准时制生产调度问题的搜索效率。48个标准算例的仿真结果证明禁忌搜索/数学规划方法在准时制生产调度解的质量方面具有一定优势。     

Study on constraint scheduling algorithm for job shop problems with multiple constraint machines

This paper focuses on a job-shop scheduling problem with multiple constraint machines (JSPMC). A constraint scheduling method for the JSPMC is proposed. It divides the machines in the shop into constraint and non-constraint machines based on a new identification method, and formulates a reduced problem only for constraint machines while replacing the operations of non-constraint machines with time lags. The constraint machines are scheduled explicitly by solving the reduced problem with an efficient heuristic, while the non-constraint machines are scheduled by the earliest operation due date (EODD) dispatching rule. Extensive computational results indicate that the proposed constraint scheduling algorithm can obtain a better trade-off between solution quality and computation time compared with various versions of the shifting bottleneck (SB) methods for the JSPMC.     

Look ahead job demanding for improving job shop performance

In this paper a new coordination approach for decentralized job shop scheduling rules is presented and analyzed in a simulation study. The coordination is based on look ahead information and contains a mechanism for demanding and supplying jobs. The simulation experiments show that the performance of conventional scheduling rules is significantly improved using the coordination mechanism.     

电子信息行业员工工作满意度评价探究--以南京市为例

本文通过选取南京市从事电子信息行业的员工为样本,建立员工工作满意度的评价指标体系,运用层次分析法对各项指标进行了权重的确定,使用模糊综合评判法,并对样本的工作满意度进行了综合评定,并对评定结果进行分析,最后提出提高电子信息行业员工工作满意度的对策及建议。     

模具生产车间调度算法研究与实现

针对模具加工的特点,分析了其车间调度中的各种实际情况和约束关系,针对不同类型设备推导出了相应的调度公式。引入了“工时虚增值”的概念,并在此基础上提出和实现了相关的优先权值调度算法。实践证明,该算法具有良好的可行性和实际可靠性。