A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. Thi...A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases： （1） b≥ an, max{m, B} 〈 n; （2） a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines.展开更多
针对实际生产中存在的时间参数不确定性问题,对单机环境下同时考虑模糊加工时间和模糊交货期的成批调度问题进行研究。分别用三角模糊数和梯形模糊数表示模糊加工时间与交货期,分析了最小化总延迟的情况下工件的模糊交货期和模糊加工时...针对实际生产中存在的时间参数不确定性问题,对单机环境下同时考虑模糊加工时间和模糊交货期的成批调度问题进行研究。分别用三角模糊数和梯形模糊数表示模糊加工时间与交货期,分析了最小化总延迟的情况下工件的模糊交货期和模糊加工时间的隶属度函数与决策者对该工件的完工时间满意度的函数关系,以满意度为优化目标,建立模糊数学优化模型。设计BFEDD(Best Fit Earliest Due Date)启发式算法,以及改进的殖民地同化策略(殖民地移动),建立改进的帝国主义竞争算法(IICA,Improved Imperialist Competitive Algorithm)对所研究问题进行求解,最后设计仿真实验验证了算法的有效性。展开更多
In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing...In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. A batching machine is a machine that can handle up to some jobs simultaneously. In this paper,we consider the total completion time under a limit on the sequence disruptions for parallel batching based on rescheduling. For the parallel batching problem based on rescheduling, we research the properties of feasible schedules and optimal schedules on the total completion time under a limit on the maximum time disruptions or total time disruptions, in which the jobs are sequenced in SPT order, and give out the pseudo-polynomial time algorithms on the number of jobs and the processing time of jobs by applying the dynamic programming method.展开更多
Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a va...Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a variety of supply chains.This includes two commonly used methods which are mathematical programming models and heuristics algorithms.Flowshop manufacturing systems are seen normally in industrial environments but few have considered certain constraints such as transportation capacity and transportation time within their supply chain.A two-stage flowshop of a single processing machine and a batch processing machine are considered with their capacity and transportation time between twomachines.The objectives of this research are to build a suitable mathematical model capable of minimizing the maximum completion time,to propose a heuristic optimization algorithm to solve the problem,and to develop an applicable program of the heuristics algorithm.AMixed Integer Programming(MIP)model and a heuristics optimization algorithmwas developed and tested using a randomly generated data set for feasibility.The overall results and performance of each approach was compared between the two methods that would assist the decision maker in choosing a suitable solution for their manufacturing line.展开更多
This study addresses the problem of two-stage scheduling on batch and single machines with limited waiting time constraint; thus, the makespan is minimized.A mixed-integer linear programming model is proposed for this...This study addresses the problem of two-stage scheduling on batch and single machines with limited waiting time constraint; thus, the makespan is minimized.A mixed-integer linear programming model is proposed for this problem. Three tight lower bounds and a heuristic algorithm are developed. The worst-case performance of the proposed algorithm is discussed. A hybrid differential evolution algorithm is also developed to improve the solution quantity. Numerical results show that the hybrid algorithm is capable of obtaining high-quality solutions and exhibits a competitive展开更多
一台批处理机一次可以同时加工多个工件（称为一批），每批工件有相同的开工和完工时间，加工时间等于其中最长工件的加工时间。本文研究单台批处理机上的在线排序，其中每个工件有事先未知的到达时间，加工时间在其到达时才知道，目标...一台批处理机一次可以同时加工多个工件（称为一批），每批工件有相同的开工和完工时间，加工时间等于其中最长工件的加工时间。本文研究单台批处理机上的在线排序，其中每个工件有事先未知的到达时间，加工时间在其到达时才知道，目标是极小化工件的最大完工时间。Zhang等（Naval Research Logistics，2001，48：241—258）就该问题提出了一个竞争比不超过2的算法MH^B，并猜测其竞争比可以达到1．618，因此是最好的在线算法。在本文中，我们证明了当机器容量趋于无穷时，算法MH^B的竞争比不可能小于2，从而就上述猜测给出了否定的回答；另外，我们也提出了一个新算法，其竞争比也不超过2。展开更多
基金Project supported by the Science and Technology Development Fund of Shanghai University(Grant No.A.10-0101-06-0017)
文摘A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases： （1） b≥ an, max{m, B} 〈 n; （2） a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines.
文摘针对实际生产中存在的时间参数不确定性问题,对单机环境下同时考虑模糊加工时间和模糊交货期的成批调度问题进行研究。分别用三角模糊数和梯形模糊数表示模糊加工时间与交货期,分析了最小化总延迟的情况下工件的模糊交货期和模糊加工时间的隶属度函数与决策者对该工件的完工时间满意度的函数关系,以满意度为优化目标,建立模糊数学优化模型。设计BFEDD(Best Fit Earliest Due Date)启发式算法,以及改进的殖民地同化策略(殖民地移动),建立改进的帝国主义竞争算法(IICA,Improved Imperialist Competitive Algorithm)对所研究问题进行求解,最后设计仿真实验验证了算法的有效性。
基金Supported by the National Natural Science Foundation of China（11271338, 11201121, 71201049） Supported by the National Natural Science Foundation of Henan Province（112300410078） Supported by the Natural Science Foundation of the Education Department of Henan Province（2011B110008）
文摘In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. A batching machine is a machine that can handle up to some jobs simultaneously. In this paper,we consider the total completion time under a limit on the sequence disruptions for parallel batching based on rescheduling. For the parallel batching problem based on rescheduling, we research the properties of feasible schedules and optimal schedules on the total completion time under a limit on the maximum time disruptions or total time disruptions, in which the jobs are sequenced in SPT order, and give out the pseudo-polynomial time algorithms on the number of jobs and the processing time of jobs by applying the dynamic programming method.
文摘Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a variety of supply chains.This includes two commonly used methods which are mathematical programming models and heuristics algorithms.Flowshop manufacturing systems are seen normally in industrial environments but few have considered certain constraints such as transportation capacity and transportation time within their supply chain.A two-stage flowshop of a single processing machine and a batch processing machine are considered with their capacity and transportation time between twomachines.The objectives of this research are to build a suitable mathematical model capable of minimizing the maximum completion time,to propose a heuristic optimization algorithm to solve the problem,and to develop an applicable program of the heuristics algorithm.AMixed Integer Programming(MIP)model and a heuristics optimization algorithmwas developed and tested using a randomly generated data set for feasibility.The overall results and performance of each approach was compared between the two methods that would assist the decision maker in choosing a suitable solution for their manufacturing line.
基金supported in part by National Natural Science Foundation of China (Grant Nos. 71690232 and 71371015)by National Science Foundation (Grant Nos. CMMI-1435800 and CMMI-1536978)
文摘This study addresses the problem of two-stage scheduling on batch and single machines with limited waiting time constraint; thus, the makespan is minimized.A mixed-integer linear programming model is proposed for this problem. Three tight lower bounds and a heuristic algorithm are developed. The worst-case performance of the proposed algorithm is discussed. A hybrid differential evolution algorithm is also developed to improve the solution quantity. Numerical results show that the hybrid algorithm is capable of obtaining high-quality solutions and exhibits a competitive
文摘一台批处理机一次可以同时加工多个工件（称为一批），每批工件有相同的开工和完工时间，加工时间等于其中最长工件的加工时间。本文研究单台批处理机上的在线排序，其中每个工件有事先未知的到达时间，加工时间在其到达时才知道，目标是极小化工件的最大完工时间。Zhang等（Naval Research Logistics，2001，48：241—258）就该问题提出了一个竞争比不超过2的算法MH^B，并猜测其竞争比可以达到1．618，因此是最好的在线算法。在本文中，我们证明了当机器容量趋于无穷时，算法MH^B的竞争比不可能小于2，从而就上述猜测给出了否定的回答；另外，我们也提出了一个新算法，其竞争比也不超过2。
