Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times

In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers' service level. The use of a bicriteria objective is motivated by the fact that successful companies in today's environment not only try to minimize their own cost but also try to fulfill their customers' need. Two main approaches, permutation and non-permutation schedules, are considered in finding the optimal schedule for a flowshop. In permutation schedules the sequence of jobs remains the same on all machines whereas in non-permutation schedule, jobs can have different sequence on different machines. A linear mathematical model for solving the non-permutation flowshop is developed to comply with all of the operational constraints commonly encountered in the industry, including dynamic machine availabilities, dynamic job releases, and the possibility of jobs skipping one or more machines, should their operational requirements deem that it was necessary. As the model is shown to be NP-hard, a metasearch heuristic, employing a newly developed concept known as the Tabu search with embedded progressive perturbation (TSEPP) is developed to solve, in particular, industry-size problems efficiently. The effectiveness and efficiency of the search algorithm are assessed by comparing the search algorithmic solutions with that of the optimal solutions obtained from CPLEX in solvable small problem instances.     

一种多信道的分簇式短波令牌协议

传统的短波令牌协议（HFTP）调度方式单一,在没有数据传送时,信道资源会被各节点间的令牌传递所占用,且令牌在通信质量较差时易丢失。基于此,提出一种多信道的分簇式短波令牌协议（CHFTP）,通过以通信质量评估为标准的分簇算法和基于预约的动态令牌调度,减小了令牌丢失的概率和令牌传递、处理的开销,并给出了仿真分析。仿真结果表明,该协议的端到端平均时延和网络吞吐量明显优于短波令牌协议,CHFTP的平均时延最多可减少75%,网络吞吐量最多可增加66.7%,适合在短波通信网络中使用。     

Two-stage flowshop earliness and tardiness machine scheduling involving a common due window

This paper studies a non-preemptive two-stage flowshop scheduling problem to minimize the earliness and tardiness under the environment of a common due window. The window size and the window location are considered to be given parameters. The just-in-time problem exists naturally and has many practical applications. The problem is shown to be NP-complete in the strong sense. We develop a branch and bound algorithm and a heuristic to solve the problem. We conduct the computational experiments to test the performances of the algorithms. A strong lower bound is derived for the branch and bound algorithm that can efficiently solve 15 jobs problem for about 5 minutes. The heuristic is shown to be efficient and effective, which can solve the problem of 150 jobs for about 20 seconds and provide near-optimal solution. We justify that the heuristic is an excellent solution approach for large problem instances. We also show that four special cases are either polynomial solvable or NP-complete in the ordinary sense.     

TinyOS任务调度策略改进研究

针对无线传感器网络操作系统TinyOS任务调度策略的不足,该文提出了一种基于快速任务排队算法和动态优先级的FQ—IP任务调度策略。随着无线传感器技术的发展,TinyOS任务队列长度由8增加到了256,这使得任务队列排队算法显得愈发重要,该文提出了一种平均查找长度较小的排队算法,通过仿真测试表明,该算法可以在增加很小的计算开销下显著提高排队速度。同时,本文提出的策略通过定时的增加任务队列中任务的优先级的大小,使得低优先权任务能够在预订的时间范围内得到系统的调度,提高了系统的整体任务吞吐量。     

大跨度天基数据链的TDD时隙调度分析与优化

针对天基数据链系统卫星间的传播时延较大且节点间距离变化较大等特点，提出了一种提高时频资源利用率、提升系统容量、减小时延的方法。在时分多址与空分多址相结合的接入方式下，进行了时隙调度的分析与优化，利用卫星星座的空间复用与大跨度传播时延特性，采用时隙编排、收发状态调整、帧格式优化等手段，将信道利用率和系统容量提升了1倍，将卫星节点在某一方向获得服务的平均等待时间缩短为原来的1/4，提高了天基数据链系统的服务质量。     

配送中心车辆调度模型及遗传算法设计

针对物流配送中心车辆调度问题,采用混合整数规划方法进行建模。对实际问题进行研兖分析后,基于所研究问题的特点,提出基于遗传算法的求解方法。通过数值实验对算法不同参数组合进行分析、比较,获得最佳参数组合．建立了有效的求解该问题的遗传算法。并通过对实际问题的数值仿真试验．验证了算法的有效性。     

流水工序调度与生产效率的关系模型分析

提出一种基于粒子群算法的流水工序调度任务优化模型。利用流水工序调度任务的特点得到流水工序时间约束条件,利用粒子群算法的原理建立流水工序调度任务优化模型,利用粒子群算法对模型进行求解。仿真实验表明,利用该算法能够得到流水工序调度问题的最优解,提高生产效率。     

广告收入上限的规制涵义--基于电视产业的分析

文章在电视产业规制实践的基础上,把节目编排作为衡量电视传播企业的主要产出,在理论上证明了当观众的总需求固定时,三类电视频道都存在基于DEA的广告收入上限,其规制涵义在于,当把广告收入看作规制者给予电视传播企业的一种转移支付的形式时,基于DEA的广告收入上限给出了促进三种经营方式竞争的规制框架,因此,国家对广告收入上限的规制有着合理的理论基础。     

西部地区新型城镇化和乡村振兴互动关系研究

新型城镇化和乡村振兴是解决城乡发展面临困境的重要战略,明确两大战略的发展现状及其互动关系,对西部地区实现资源的有效配置、促进城乡融合有重要意义。基于我国西部地区12个省份2013—2018年的面板数据,建立了西部地区新型城镇化和乡村振兴的评价指标体系,运用熵值法和耦合协调度模型测算出西部地区两大战略的发展水平及其耦合协调度。结果发现,2013—2018年,西部地区的新型城镇化水平不断提高,乡村振兴的发展水平低于新型城镇化水平;两大战略发展存在空间差异,且发展水平高的地区其耦合协调度也较高,在内蒙古、重庆、广西和四川等发展水平较高的地区,两大战略实现良性互动,在青海和西藏等比较落后的地区,两者勉强协调。西部地区需要加强农村的基础设施建设,注重交通通信的发展,重视人力资源,加强生态环境建设,加快产业结构的优化升级,实现两大战略的高水平协调共振和城乡融合发展。     

基于客户满意度的服装业车辆调度研究

从客户满意度的角度出发,针对车辆调度问题进行了优化探讨。首先提出对客户满意度进行评价的客户满意度模糊隶属函数,并在此基础上构造基于客户满意度的车辆调度模型。其次设计了求解车辆调度问题的遗传算法,并和客户满意度模糊隶属函数相结合,可以避免车辆调度问题只能获得满意解的情况。