论文部分内容阅读
旨在研究并解决一类从集装箱混合装卸作业环境中提取的多工件族无缓冲混合Flow Shop问题.针对该问题的多工件族、无缓冲、部分专用机、与机器和顺序相关的准备时间和作业时间等特点,构建了问题的混合整数线性规划模型.鉴于问题的NP-hard特性,构造型的启发式算法被构建,核心思想是基于提出的机器库存和配额等概念,动态构建含有三元副的调度列表,三元副表示与其一一对应的工件在3阶混合Flow Shop中的加工轨迹.通过仿真实验、下界分析,发现算法能获得好的近优解和低的计算成本.更为重要的是.算法尤其适合解决大规模的实际问题.
This paper aims to study and solve a class of Flow Shop problem with multi-component family extracted from container mixed loading and unloading working environment.This paper deals with the problem of multi-component family, unbuffered, some dedicated machines, machine- and order-related preparation time and Time and other characteristics, a mixed integer linear programming model of the problem is constructed.Because NP-hard characteristic of the problem, constructed heuristic algorithm is constructed, the core idea is based on the concept of machine inventory and quota, the dynamic construction of a ternary Vice scheduling list, the ternary pair represents the corresponding one of the workpiece in the third-order hybrid Flow Shop in the processing trajectory.Through simulation experiments, lower bound analysis, the algorithm can find good near-optimal solutions and low computational costs. Importantly, algorithms are especially well suited to solving large-scale practical problems.