Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines

This paper considers the flexible flow line problem with unrelated parallel machines at each stage and with a bottleneck stage on the line. The objective of the problem is to minimize the total tardiness. Two bottleneck-based heuristics with three machine selection rules are proposed to solve the problem. The heuristics first develop an indicator to identify a bottleneck stage in the flow line, and then separate the flow line into the upstream stages, the bottleneck stage, and the downstream stages. The upstream stages are the stages ahead of the bottleneck stage and the downstream stages are the stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage. Using the new approach, the bottleneck-based heuristics develop two decision rules to iteratively schedule the jobs at the bottleneck stage, the upstream stages, and the downstream stages. In order to evaluate the performance of the bottleneck-based heuristics, seven commonly used dispatching rules and a basic tabu search algorithm are investigated for comparison purposes. Seven experimental factors are used to design 128 production scenarios, and ten test problems are generated for each scenario. Computational results show that the bottleneck-based heuristics significantly outperform all the dispatching rules for the test problems. Although the effective performance of the bottleneck-based heuristics is inferior to the basic tabu search algorithm, the bottleneck-based heuristics are much more efficient than the tabu search algorithm. Also, a test of the effect of the experimental factors on the dispatching rules, the bottleneck-based heuristics, and the basic tabu search algorithm is performed, and some interesting insights are discovered.     

Genetic algorithm-based heuristics for an open shop scheduling problem with setup,processing, and removal times separated

This report proposes a solution to the open shop scheduling problem with the objective of minimizing total job tardiness in the system. Some practical processing restrictions, such as independent setup and dependent removal times, are taken into account as well. The addressed problem is first described as a 0–1 integer programming model, and is then solved optimally. Subsequently, some hybrid genetic-based heuristics are proposed to solve the problem in an acceptable computation time. To demonstrate the adaptability of these heuristics, some performance comparisons are made with solutions provided by running either a mathematical programming model or certain classic meta-heuristics such as genetic algorithm, simulated annealing, and tabu search in various manufacturing scenarios. The experimental results show that the hybrid genetic-based heuristics perform well, especially the DGA. However, these heuristics require some more additional computations but are still acceptable.     

Some First-Order Algorithms for Total Variation Based Image Restoration

This paper deals with first-order numerical schemes for image restoration. These schemes rely on a duality-based algorithm proposed in 1979 by Bermùdez and Moreno. This is an old and forgotten algorithm that is revealed wider than recent schemes (such as the Chambolle projection algorithm) and able to improve contemporary schemes. Total variation regularization and smoothed total variation regularization are investigated. Algorithms are presented for such regularizations in image restoration. We prove the convergence of all the proposed schemes. We illustrate our study with numerous numerical examples. We make some comparisons with a class of efficient algorithms (proved to be optimal among first-order numerical schemes) recently introduced by Y. Nesterov.     

基于结构张量的自适应CTV彩色图像恢复模型

讨论一种基于非线性扩散方程的彩色图像去噪方法。在图像去噪的3个基本要求的基础上,总结出调和项模型和彩色总变差去噪模型中的不足,利用图像的局部信息构造函数使得模型在接近图像边缘处各向异性平滑并保持边界。在平坦区域各向同性平滑,防止阶梯效应的产生,并利用角点信息保持了角点形状。实验结果表明,所建模型能够较好地保持图像中目标的几何结构,同时具有良好的去噪能力。     

TV改进算法及其在人脸识别中的应用

针对传统全变分（TV）模型在测试过程中存在的问题,将弹性网引入TV模型中,采用二次多项式对TV模型所丢弃的人脸低频信息进行光照归一化处理,并提取图像的高频信息,在YaleB图像库中测试其性能,仿真实验结果表明,相对于TV模型,TV＋二次多项式模型能够有效提高图像识别率。     

用于彩色图像复原的带有高阶耦合项的TV模型

提出了一种改进的TV(Total Variance)彩色图像复原方法。为消除TV模型的各向异性扩散导致的块效应,采用在TV模型的基础上耦合高阶项的新模型;并将这个新的模型推广到彩色图像,利用多通道的耦合机制实现各单色通道图像复原过程的相互制约。新模型保持了各向异性扩散的特性,图像的边缘得到了保持。实验结果证明, 与其它模型的复原 彩色图像相比,新模型复原的图像的峰值信噪比(PSNR)有了更大的提高,图像的非边缘区看上去更加平滑自然。     

基于蓝牙4.0的微型核辐射剂量计设计

针对目前个人核辐射剂量监测手段便携性差、实时性较差和持续监测能力不足等问题,设计了一种基于蓝牙4.0模块的微型低功耗核辐射剂量计;系统使用计数管探测辐射粒子,充分利用了MSP430混合信号处理器和蓝牙4.0模块的低功耗特性,体积小巧、续航能力强、运行稳定可靠;该剂量计配合手机APP即可单独使用,又可多台组网使用,可为人员提供持续可靠地实时剂量率监测和个人剂量分析,在核工业及核医学个人防护领域具有广阔的应用前景。     

Scheduling a batching machine with convex resource consumption functions

In various industries jobs undergo a batching, or burn in, process where different tasks are grouped into batches and processed simultaneously. The processing time of each batch is equal to the longest processing time among all jobs contained in the batch. All to date studies dealing with batching machines have considered fixed job processing times. However, in many real life applications job processing times are controllable through the allocation of a limited resource. The most common and realistic model assumes that there exists a non-linear and convex relationship between the amount of resource allocated to a job and its processing time. The scheduler?s task when dealing with controllable processing times is twofold. In addition to solving the sequencing problem, one must establish an optimal resource allocation policy. We combine these two widespread models on a single machine setting, showing that both the makespan and total completion time criteria can be solved in polynomial time. We then show that our proposed approach can be applied to general bi-criteria objective comprising of the makespan and the total completion time.     

微波消解法快速测定废水中的总磷

采用微波对废水中的总磷进行消解,考察了消解时间、功率等不同实验条件对标样微波消解的影响,得出本实验消解的最佳条件,即过硫酸钾溶液用量为 0.5 mL,压力为10 MPa,消解时间为 2 min：并将该法与总磷测定的常规方法进行了比较,结果表明,过硫酸钾-微波消解法操作简单,效率高,对工作环境污染小.最后对微波消解法的精密度和准确度进行验证,实验结果表明其具有良好的精密度和准确度.     

Note on “Unrelated parallel-machine scheduling with deteriorating maintenance activities”

In this note, we prove that both problems studied by Cheng et al. [Cheng, T. C. E., Hsu, C.-J., & Yang, D.-L. (2011). Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers and Industrial Engineering, 60, 602–605] can be solved in O(n^m+3) time no matter what the processing time of a job after a maintenance activity is greater or less than its processing time before the maintenance activity, where m is the number of machines and n is the number of jobs.