论文部分内容阅读
给出了加工时间离散可控的作业车间调度问题(job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)基于析取图的模型及其数学描述.提出一种三步分解方法,使得JSP-DCPT可以通过求解一个作业车间调度问题(job-shop scheduling problem,JSP)以及一系列离散时间-成本权衡问题得到解决.为简化分解方法,引入时间-成本相平面描述离散时间-成本权衡问题的权衡点,并详细阐释了一种基于极限模式的集合支配理论以确定用于消减JSP-DCPT分解所得离散时间-成本权衡问题的一个上界.随后提出一种基于极限模式的集合支配分解算法EMSDDA(extreme mode-based set dominant decomposition algorithm).基于JSP标准算例FT10构造了测试算例JSPDCPT_FT10,实验仿真验证了提出的理论及分解方法的有效性.
A job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is presented, which is based on the extract graph model and its mathematical description. A three-step decomposition method is proposed to make JSP -DCPT can be solved by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoffs.In order to simplify the decomposition method, the introduction of the time-cost phase description of discrete time-cost trade-offs Trade-off point, and expounds a limit-based set dominance theory to determine the upper bound of the discrete time-cost trade-off problem for reducing the JSP-DCPT factorization.Furthermore, a limit-based set dominance decomposition algorithm EMSDDA Based on the JSP standard example FT10, a test example JSPDCPT_FT10 is constructed. The experimental simulation proves the validity of the proposed method and the decomposition method.