抓钩排序问题综述

为提高生产率,先进制造系统中广泛采用自动导向小车、机器人和抓钩（Hoist)等自动化材料搬运装置。这些运送装置的排序直接影响系统的质量、生产率和安全性,因此,在生产中应该得到足够的重视。对抓钩排序问题进行了综述。     

提高交付安全性的瓶颈工序作业排序方法

多工序Job-Shop排序问题是困难的NP问题。但是实际生产中，瓶颈工序比较固定和明显，并且连续满负荷运转，在瓶颈工序上控制住作业次序，对快速交货型订单的交付起关键作用。针对瓶颈工序有多台设备的作业排序模型，采用动态规划的原理，先找到交货期和产能矛盾最突出的阶段，分段用隐枚举法排序，得到交付最安全的排序方案。该算法简单，计算量小。     

SKCAPP-1系统在津通过鉴定

由国家机械工业委员会第五设计研究院和天津市水电控制设备厂共同开发研制的SKCAPP—1系统(天津市水电控制设备厂计算机辅助套类零件工艺规程设计系统)于一九八八年二月十日由天津市机械工业管理局委托电机管理处主持进行了鉴定。 该系统采用了半创成式模块化设计,根据决策原则进行逻辑判断检索工序(工步)模块,采用五院提出的工序(工步)“优先序号”方法对工序(工步)排序,成功地解决了工艺过程中粗精交叉和工序内工步排列问题,减少了存储容量。     

蚀刻气废气处理装置

日本宇部兴产公司研制了一种在半导体制造工序中使用的蚀刻气的废气处理装置“UBE-RID”，最近正式开始销售。该公司是日本国内生产铝的蚀刻气(三氯化硼)的厂家。当三氯化硼与水分和空气接触时，会生成硼酸和氧化硼等固体物质，导致废气系统的管道和洗涤器封闭。为了有助于安全使用三氯化硼，该公司研制了简便的废气处理装置，     

一种动态识别瓶颈机床的前向启发算法

为了解决作业车间调度问题中的瓶颈漂移和动态识别问题,提出了一种动态识别瓶颈机床的前向启发算法.该算法引入搜索空间的概率分析方法,通过工序开工概率、工序对机床的独立需求概率、机床累计需求概率和3个量化参数,构造了以竞争高峰时段的机床负荷量大小为判定依据的瓶颈机床识别启发规则.实验结果表明该方法能够有效识别瓶颈机床,使得大规模作业车间调度的求解复杂度显著降低.     

成组单元的作业排序

多品种小批量生产中为提高生产率和经济效益采用成组技术。作业排序是成组技术管理工作中的一个重要问题。本文从多工序成组作业排序的基本方法中着重介绍了一种方法,并结合生产实际应用分析如何进行修正的方法。文中还结合分析对比其他几种方法,指出了本文介绍方法的优点。     

过滤与分离——加工处理行业高质量、高产量的保证

如何保证产品的质量，追求最大生产率是加工处理行业眼下关心的两大问题。承诺既能保证质量又能实现最大化生产率的固／液分离技术有很多种，但常常是工艺路线复杂、操作步骤繁多。与众不同的是瑞士DrM公司制造的过滤器FUNDABAC。它操作简单并容易掌握，FUNDABAC产品已经把固／液分离技术变成了加工处理行业中一种十分实用且有效的工具。本文对FUNDABAC产品的特色作以介绍。     

HTBS微耕机包装线仿真与优化

针对HTBS公司微耕机产能提升的紧迫性,分析了微耕机生产线工段——包装线的工位作业及工序流程;依据秒表测时法所测数据,结合Flexsim仿真技术分析包装线瓶颈;运用经验排序法对包装线瓶颈工位工序及其他工位工序进行合理排序,以平衡各工位负荷,并通过Flexsim建立优化后的包装线仿真模型验证其有效性。微耕机包装线优化后,生产线平衡率由66.67%提高到90.77%,日产量由354台提高到436台,平衡优化效果明显。     

并行加工条件下作业排序方法研究

对单工序并行加工条件下的作业排序问题进行了深入研究，在给出该问题的整数规划模型的基础上，找出了一种新的启发式算法，并编写了相应的计算机程序，示例和模拟结果表明，新算法优于LPT算法并可以通过自迭代求出较优的完工期。同时还可以降低零件的平均完工时间。     

基于TOC的分销系统订单排序法则

基于TOC,用全局的观点分析分销系统环境下的多订单排序问题,综合考虑分销系统仓库容量,上游生产企业的生产能力,特别是瓶颈能力的限制,还有订单对财务的影响3个因素,提出基于TOC分销系统订单排序法则.     

Multi-degree cyclic hoist scheduling with time window constraints

This paper deals with the multi-degree cyclic single-hoist scheduling problem with time window constraints, in which multiple identical parts enter and leave the system during each cycle. We propose an analytical mathematical model and a branch-and-bound algorithm so as to find a cyclic sequence of hoist moves that maximises the throughput. The branch-and-bound algorithm implicitly enumerates the sequence of hoist moves and requires the solution of a specific set of linear programming problems (LPPs). Computational results on benchmark instances and randomly generated test instances are presented.     

Electroplating production scheduling by cyclogram unfolding in dynamic hoist scheduling problem

This article presents a scheduling problem that exists in electroplating lines. An electroplating line is an automated manufacturing system which covers machine parts with a coat of metal. It consists of a set of tanks that chemically process the items and hoists that transport the items between workstations. Scheduling the movements of these hoists is commonly called a hoist scheduling problem. The most common approaches to the problem are cyclic hoist scheduling problem and dynamic hoist scheduling problem (DHSP). This article presents a DHSP solution method. The method divides the problem into real time and non-real time. Special schedules, called cyclograms, allow minimisation of the length of non-real time calculations. A notion of the problem is introduced, an outline of a scheduling system is presented, as well as the heuristic algorithm itself. The results of the described method, referred to as a cyclogram unfolding method, are compared to several cases available in the literature.     

Mixed-integer linear programming method for multi-degree and multi-hoist cyclic scheduling with time windows

Multi-degree cyclic hoist scheduling and multi-hoist cyclic scheduling are both capable of improving the throughput in an automatic electroplating line. However, previous research on integrated multi-degree and multi-hoist cyclic scheduling is rather limited. This article develops an optimal mixed-integer linear programming model for the integrated multi-degree and multi-hoist cyclic scheduling with time window constraints. This model permits overlap on hoist coverage ranges, and it proposes new formulations to avoid hoist collisions, by which time window constraints and tank capacity constraints are also formulated. A set of available benchmark instances and newly generated instances are solved using the CPLEX solver to test the performance of the proposed method. Computational results demonstrate that the proposed method outperforms the zone partition heuristic without overlapping, and the throughputs are improved by a significant margin using the proposed method, especially for large-size instances.     

Scheduling continuous aluminium casting lines

This study considers the problem of scheduling casting lines of an aluminium casting and processing plant. In aluminium processing plants, continuous casting lines are the bottleneck resources, i.e. factory throughput is limited by the amount of aluminium that can be cast. The throughput of a casting line might be increased by minimizing total setup time between jobs. The objective is to minimize setup time on production lines for a given time period while balancing workload between production lines to accommodate potential new orders. A mathematical formulation for scheduling jobs to minimize the total setup time while achieving workload balance between the production lines is presented. Since the casting scheduling problem is an NP-hard problem, even with only one casting line, a four-step algorithm to find good solutions in a reasonable amount of time is proposed. In this process, a set of asymmetric travelling salesman problems is followed by a pairwise exchange heuristic. The proposed procedure is applied to a case study using real casting data.     

Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines

This paper develops new bottleneck-based heuristics with machine selection rules to solve the flexible flow line problem with unrelated parallel machines in each stage and a bottleneck stage in the flow line. The objective is to minimize the number of tardy jobs in the problem. The heuristics consist of three steps: (1) identifying the bottleneck stage; (2) scheduling jobs at the bottleneck stage and the upstream stages ahead of the bottleneck stage; (3) using dispatching rules to schedule jobs at the downstream stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage, and two decision rules are developed to schedule the jobs on the bottleneck stage. This new approach neatly overcomes the difficulty of determining feasible arrival times of jobs at the bottleneck stage. In order to evaluate the performance of the proposed heuristics, six well-known dispatching rules are examined for comparison purposes. Six factors are used to design 729 production scenarios, and ten test problems are generated for each scenario. Computational results show that the proposed heuristics significantly outperform all the well-known dispatching rules. An analysis of the experimental factors is also performed and several interesting insights into the heuristics are discovered.     

Production in the factory of the future

This paper proposes an algorithm for hoist scheduling problems in a flexible PCB electroplating line where there is no buffer among workstations. Due to its chemical process nature, the processing times have to be controlled within a specified range (i.e. between a maximum processing time and a minimum processing time). The product will become defective if this constant is violated. The objective is to maximize throughput with no defective product. The proposed algorithm schedules jobs entering the system based on the specified range of processing time. A simulation study shows that the proposed algorithm outperforms the basic algorithm that schedules jobs based on the minimum processing times.     

Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution

This paper studies the single-hoist cyclic scheduling problem in electroplating systems with two extended features. One extension is that the products must visit some processing tanks more than once (multi-function tanks). Another is that more than one identical tank is used at some stages. These extensions are common in practical electroplating lines and can increase the lines' processing capacity. However, they make the hoist scheduling problem more complicated and little research has been done to optimize the hoist moves in such extended practical systems. In this paper, we develop a comprehensive mixed integer linear programming model to find optimal solutions to the single-hoist cyclic scheduling problem for electroplating lines with these extensions. Examples are given to demonstrate the effectiveness of the model in different types of problems.     

Mathematical models and a hunting search algorithm for the no-wait flowshop scheduling with parallel machines

Majority of researches in no-wait flowshop scheduling assume that there is only one machine at each stage. But, factories commonly duplicate machines in parallel for each operation. In this case, they balance the speed of the stages, increase the throughput of the shop floor and reduce the impact of bottleneck stages. Despite their importance, there is no paper to study the general no-wait flowshop with parallel machines. This paper studies this problem where the objective is to minimise makespan. Since there is no mathematical model for the problem, we first mathematically formulate it in form of two mixed integer linear programming models. By the models, the small instances are optimally solved. We then propose a novel hunting search metaheuristic algorithm (HSA) to solve large instances of the problem. HSA is derived based on a model of group hunting of animals when searching for food. A set of experimental instances are carried out to evaluate the algorithm. The algorithm is carefully evaluated for its performance against an available algorithm by means of statistical tools. The related results show that the proposed HSA provides sound performance comparing with other algorithms.     

供应链时间瓶颈及其价值评价研究

供应链整体的时间优化取决于少数的薄弱环节,即供应链上的"时间瓶颈",时间瓶颈包括能力瓶颈、不增值瓶颈、调度瓶颈和界面瓶颈四种形式,分析了形成这些瓶颈的主要因素;为了在多个瓶颈中确定突破重点,以瓶颈消除后供应链的产出速率和供应链总体流程周期的改善率为依据,建立了时间瓶颈的价值评价模型;总结了供应链上时间压缩和瓶颈消除应遵循的结构化程序.