带运输时间的无等待供应链在线调度问题研究

研究了供应链在线调度问题 .该问题具有工件无等待,工序之间存在运输时间,加工时间介于一个区间等特点,制造商随时可能接到顾客订单,订单到达前,所有信息如订单数量,到达时间及加工时间等均未知 .研究了在不改变已有工件调度的情况下,使用资源的可用时间区间最早完成临时订单的算法. 计算机仿真表明,使用该算法求解大规模临时订单问题是十分有效的.

     

供应链环境下的柔性流水线调度问题*

针对供应链环境下的柔性流水线调度问题,对制造商接到的顾客订单,给出了在不改变已有工件调度的前提下,使用资源的可用时间区间尽早完工的实时调度算法,通过证明可知对于每个工件使用该算法都能够求得最短完工时间。最后给出了应用该算法求解的一个实际例子,并进行了仿真实验,仿真结果令人满意。     

批量无等待调度问题的微粒群蛙跳混合优化算法*

将离散微粒群与蛙跳算法相结合解决以最大完工时间为指标的批量无等待流水线调度问题.结合微粒群算法较强的全局收敛能力和蛙跳算法较强的深度搜索能力,设计了三种混合算法,平衡了算法的全局开发能力和局部探索能力.对随机生成不同规模的实例进行了广泛的实验,仿真实验结果的比较表明了所得混合算法的有效性和高效性.     

FMS实时在线调度的仿真建模

为提供进行ＦＭＳ系统在线及离线分析所需的各种信息，本文给出了“最小状态信息”集合的定义。在此基础上，采用面 向对象的设计方法和Ｃ＋＋语言研制开发了具有实时在线仿真能力的ＦＭＳ仿真语言ＳＬＦＭＳ，为在线开展ＦＭＳ调度优化问题的研究提供了良好的仿真支持环境。最后，本文提出并建立了ＦＭＳ实时在线调度优化系统，为解决ＦＭＳ的实时在线调度优化问题提供了一条有效途径。     

有滞留时间约束的集束型装备在线调度问题研究

针对半导体制造中有滞留时间约束的集束型装备,研究了临时晶网到达时的在线调度问题,描述了调度问题域.建立了问题的数学模型,并根据模型提出了两层调度方法.外层算法通过粒子群优化过程求解临时晶网的加工顺序;内层算法在给定加工顺序的基础上,采用前向和后向递推方法获得口,行解窄问,并从可行解窄问获得最优完工时间.从理论上证明了算...     

纺织企业Flow-Shop调度问题的研究与实现

以某纺织企业纺纱车间为背景,针对Flow-Shop调度问题,以"最大完工时间最小化"为调度性能指标建立数学模型,应用微粒群算法(PSO)对该问题进行求解,通过仿真实现验证了其有效性。     

联盟运输调度问题的粒子群算法研究

联盟运输调度问题是在基本运输调度问题基础上所发展起来的、具有重要实用价值的一类组合优化难题.粒子群算法(PSO)是一种新兴的基于群智能的演化计算技术,该算法与传统方法相比有着较高的收敛速度和计算精度,可以在解空间内高效地寻找到全局最优解.将其应用于联盟运输调度问题,并针对联盟运输调度问题中最优解的分布特点,对标准粒子群算法进行了改进,克服了标准粒子群算法收敛速度过快且易收敛于局部最优的缺点.对比实验结果表明,改进后的粒子群算法可以快速、有效求得最优解.     

带时间窗的中转联盟运输调度问题的混合算法研究

介绍中转联盟运输调度问题的优越性和重要研究意义,建立了带中转点的优化运输调度问题的数学模型,并构造了求解该模型的优化算法,算法针对城市货物运输的特点,首先结合sweep算法和saving算法确定需求点与中转点之间的分派,随后采用改进的蚁群算法对每个中转点的运输路线进行优化。实例计算表明,提出的模型和算法能够有效的求解中转联盟运输调度问题。     

带选址的关联运输调度问题研究

对零售点的选址问题和关联货物配送问题建模,分别应用改进的混沌遗传算法和免疫克隆选择算法求解该模型,前者采用混沌初始化方法产生初始种群,使种群具有较好的多样性,并采用混沌搜索策略以提高算法的收敛速度和全局搜索能力.最后比较两种算法的求解结果,结果证实了改进的混沌遗传算法求解该模型的有效性与优越性.     

基于供应链的复杂车型运输路线协调调度算法研究

研究基于供应链的复杂车型运输路线协调调度算法,获得车辆运输最优路线。文章将使用车联网技术获取的交通信息作为预测车流量的信息基础,构建包括多种约束条件的运输路线协调调度模型,然后采用改进蚁群算法求解模型,最终输出最优供应链运输路线协调调度方案。     

粒子群算法求解任务可拆分项目调度问题

首先针对任务可拆分的项目调度问题,提出一种带有局部搜索的粒子群算法LSPSO;然后采用基于任务排列的粒子表示方法,将遗传算法中的定位交叉引入粒子的更新过程中,并采用局部搜索技术对更新后的粒子进行改进;最后对Patterson测试集中110个问题实例进行了测试,实验结果表明,算法LSPSO具有较快的速度,所给出的调度方案较优.     

A novel multi-objective meta-heuristic model for solving cross-docking scheduling problems

Cross-docking is a material handling and distribution technique in which products are transferred directly from the receiving dock to the shipping dock, reducing the need for a warehouse or distribution center. This process minimizes the storage and order-picking functions in a warehouse. In this paper, we consider cross-docking in a supply chain and propose a multi-objective mathematical model for minimizing the make-span, transportation cost and the number of truck trips in the supply chain. The proposed model allows a truck to travel from a supplier to the cross-dock facility and from the supplier directly to the customers. We propose two meta-heuristic algorithms, the non-dominated sorting genetic algorithm (NSGA-II) and the multi-objective particle swarm optimization (MOPSO), to solve the multi-objective mathematical model. We demonstrate the applicability of the proposed method and exhibit the efficacy of the procedure with a numerical example. The numerical results show the relative superiority of the NSGA-II method over the MOPSO method.     

A particle swarm optimization algorithm for solving unbalanced supply chain planning problems

This paper focuses on developing a decision methodology for the production and distribution planning of a multi-echelon unbalanced supply chain. In the supply chain system discussed here, multiple products, production loss, transportation loss, quantity discount, production capacity, and starting-operation quantity are considered simultaneously, and the system pattern is ascertained with based on appropriate partners and suitable transportation quantities. To make a quality decision in supply chain planning, we first propose an optimization mathematical model which integrates cost and time criteria. Then, a particle swarm optimization (PSO) solving method is proposed for obtaining acceptable results is called MEDPSO. The MEDPSO introduces the maximum possible quantity strategy into the basic procedure of PSO to generate the initial feasible population in a timely fashion and provides an exchange and disturbance mechanism to prevent particle lapse into the local solution. Finally, one case and two simulated supply chain structures are proposed to illustrate the effectiveness of the MEDPSO method by comparing the results of classical GA and PSO in solving multi-echelon unbalanced supply chain planning problems with quantity discount.     

Vehicle routing scheduling for cross-docking in the supply chain

One of the most important factors in implementing supply chain management is to efficiently control the physical flow of the supply chain. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. In various methods, cross-docking is considered a good method to reduce inventory and improve responsiveness to various customer demands. However, previous studies have dealt mostly with the conceptual advantages of cross-docking or actual issues from the strategic viewpoint. It is also necessary, however, to considering cross-docking from an operational viewpoint in order to find the optimal vehicle routing schedule. Thus, an integrated model considering both cross-docking and vehicle routing scheduling is treated in this study. Since this problem is known as NP-hard, a heuristic algorithm based on a tabu search algorithm is proposed. In the numerical example, our proposed algorithm found a good solution whose average percentage error was less than 5% within a reasonable amount of time.     

Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment

In this study, an integrated multi-objective production-distribution flow-shop scheduling problem will be taken into consideration with respect to two objective functions. The first objective function aims to minimize total weighted tardiness and make-span and the second objective function aims to minimize the summation of total weighted earliness, total weighted number of tardy jobs, inventory costs and total delivery costs. Firstly, a mathematical model is proposed for this problem. After that, two new meta-heuristic algorithms are developed in order to solve the problem. The first algorithm (HCMOPSO), is a multi-objective particle swarm optimization combined with a heuristic mutation operator, Gaussian membership function and a chaotic sequence and the second algorithm (HBNSGA-II), is a non-dominated sorting genetic algorithm II with a heuristic criterion for generation of initial population and a heuristic crossover operator. The proposed HCMOPSO and HBNSGA-II are tested and compared with a Non-dominated Sorting Genetic Algorithm II (NSGA-II), a Multi-Objective Particle Swarm Optimization (MOPSO) and two state-of-the-art algorithms from recent researches, by means of several comparing criteria. The computational experiments demonstrate the outperformance of the proposed HCMOPSO and HBNSGA-II.     

A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain

The location and routing scheduling problems with cross-docking can be regarded as new research directions for distribution networks in the supply chain. The aims of these problems are to concurrently design a cross-docking center location and a vehicle routing scheduling model, known as NP-hard problems. This paper presents a two-stage mixed-integer programming (MIP) model for the location of cross-docking centers and vehicle routing scheduling problems with cross-docking due to potential applications in the distribution networks. Then, a new algorithm based on a two-stage hybrid simulated annealing (HSA) with a tabu list taken from tabu search (TS) is proposed to solve the presented model. This proposed HSA not only prevents revisiting the solution but also maintains the stochastic nature. Finally, small and large-scale test problems are randomly generated and solved by the HSA algorithm. The computational results for different problems show that the proposed HSA performs well and converges fast to reasonable solutions.     

Multiproduct multiple-buyer single-vendor supply chain problem with stochastic demand, variable lead-time, and multi-chance constraint

In this paper, a multi-product multi-chance constraint joint single-vendor multi-buyers inventory problem is considered in which the demand follows a uniform distribution, the lead-time is assumed to vary linearly with respect to the lot size, and the shortage in combination of backorder and lost-sale is assumed. Furthermore, the orders are placed in multiple of packets, there is a limited space available for the vendor, there are chance constraints on the vendor service rate to supply the products, and there is a limited budget for each buyer to purchase the products. While the elements of the buyers’ cost function are holding, shortage, order and transportation costs, the set up and holding costs are assumed for the vendor. The goal is to determine the re-order point and the order quantity of each product for each buyer such that the chain total cost is minimized. We show the model of this problem to be a mixed integer nonlinear programming type and in order to solve it a particle swarm optimization (PSO) approach is used. To justify the results of the proposed PSO algorithm, a genetic algorithm (GA) is applied as well to solve the problem. Then, the quality of the results and the CPU times of reaching the solution are compared through three numerical examples that are given to demonstrate the applicability of the proposed methodology in real world inventory control problems. The comparison results show the PSO approach has better performances than the GA method.     

A new particle swarm optimization for the open shop scheduling problem

This paper presents a new particle swarm optimization (PSO) for the open shop scheduling problem. Compared with the original PSO, we modified the particle position representation using priorities, and the particle movement using an insert operator. We also implemented a modified parameterized active schedule generation algorithm (mP-ASG) to decode a particle position into a schedule. In mP-ASG, we can reduce or increase the search area between non-delay schedules and active schedules by controlling the maximum delay time allowed. Furthermore, we hybridized our PSO with beam search. The computational results show that our PSO found many new best solutions of the unsolved problems.     

Supporting decisions in real-time enterprises: autonomic supply chain systems

Supporting decisions in real time has been the subject of a number of research efforts. This paper reviews the technology and architecture necessary to create an autonomic supply chain for a real-time enterprise for supply chain systems. The technologies weaved together include knowledge-based event managers, intelligent agents, radio frequency identification (RFID), database and system integration, and enterprise resource planning systems. This article is part of the “Handbook on Decision Support Systems” edited by Frada Burstein and Clyde W. Holsapple (2008) Springer.     

Supply chain modeling in uncertain environment with bi-objective approach

Supply chain is viewed as a large-scale system that consists of production and inventory units, organized in a serial structure. Uncertainty is the main attribute in managing the supply chains. Managing a supply chain (SC) is very difficult, since various sources of uncertainty and complex interrelationships among various entities exist in the SC. Uncertainty may result from customer’s demand variability or unreliability in external suppliers. In this paper we develop an inventory model for an assembly supply chain network (each unit has at most one immediate successor, but any number of immediate predecessors) which fuzzy demand for single product in one hand and fuzzy reliability of external suppliers in other hand affect on determination of inventory policy in SCM. External supplier’s reliability has determined using a fuzzy expert system. Also the performance of supply chain is assessed by two criteria including total cost and fill rate. To solve this bi-criteria model, hybridization of multi-objective particle swarm optimization and simulation optimization is considered. Results indicate the efficiency of proposed approach in performance measurement.