生产计划跟调度.pptVIP

生产计划与调度;OUTLINE－Production Scheduling;离散制造过程生产调度;车间作业调度的特点;给定一个工件的集合P和一个机器的集合M 每个工件包括多道工序 Ji={Pi1 ….. Pik} 每台设备可以多个加工任务JMi={J(1) ….. J(li) } 约束： 顺序约束：同一个产品的有序工序对必须在前一工序完成后才能开始 占用约束：每台机床同一时间只能加工一个产品的某个工序，每道工序需要在一台给定的机器上非间断地加工一段时间;Job-shop问题;Flow-shop调度问题 ;Flow-shop问题示例;调度结果甘特图;调度问题不同特点;实际调度问题;ERP作业计划;APS先进计划调度;TOC约束理论一;APS约束类型 ;APS计划算法一;APS计划算法二;启发式规则 ;APS中的启发式规则;流程工业调度特点;生产调度;静态调度;动态调度;最优调度问题描述;生产过程的约束 ;Scheduling model;优化目标 ;间歇型生产过程调度;中间贮罐协调工序间差异;中间存储策略;连续型流程工业生产调度;连续型流程工业生产调度;Scheduling Problems Type I;Scheduling Problems Type II;过程调度类型;Example;Scheduling Problems Property;Scheduling in Chemical Industry;State-Task Network (STN) Representation;State-Task Network (STN) Representation;State-Task Network (STN) Representation;优化调度模型－时间表示方式;优化调度模型－时间表示方式 ;Time Representations -Discrete Time Representation;Time Representations -Continuous Time Representation;Time Representations - Event-Based Representation ;时间表达方式差异;Example1;Example2;Example2-Remark;Example3;Example3-Result;基于UDM的调度优化模型;基于UDM的调度优化模型;计划调度优化方法－数学规划;计划调度优化方法－数学规划;计划调度优化方法－人工智能;运筹学和人工智能融合 ;分解Basic Decomposition Idea;分解Basic Decomposition Idea;Modeling and Solution Paradigms ;Mathematical vs. Constraint Programming; Proposed Strategy ; Fix no/type of tasks and assignment decisions Problem is highly constrained: suitable for CP If feasible, obtain lower bound Add integer cut and continue until bounds converge;Generalization of Decomposition Framework I Multipurpose Batch Plant ;Generalization of Decomposition Framework - General Multi-stage Plant; Generalization of Decomposition Framework - Multi-stage Plant: demand in orders;Generalization of Decomposition Framework: Single-stage;Generalization of Decomposition Framework II;Generalization of Decomposition Framework IV;智能方法－约束规划;约束规划－Constraint programming ;约束规划－收缩;约束规划－搜索;constraint satisfaction tree search algorithms;The algorithm CheckConsistency;智能方法-遗传算法 ;智能方法－Agent;ExPlanTech;Multi Agent system(MAS);Multi Agent system(MAS);仿真模拟 ;Supply Chain;Sche