钢管生产调度中可中断Job-Shop问题的数学模型  

Preemptive Job-shop Scheduling Problem in Steelpipes Production and Its Mathematical Programming Model

作　　者：霍佳震[1] 钟海嫣[1] 吴群[1] 刘桂林[2] 

机构地区：[1]同济大学经济与管理学院,上海200092 [2]宝山钢铁股份有限公司宝钢分公司,上海201900

出　　处：《系统仿真学报》2008年第11期2789-2792,2796,共5页Journal of System Simulation

基　　金：上海市自然科学基金(06JC14064);同济大学211振兴计划供应链与工业工程实验室建设项目;上海市科委浦江人才计划项目(06PJ14311)

摘　　要：现针对国内大型钢铁企业钢管冷区生产调度的实际问题,在生产连续、库存限制、部分人工调度的情况下,利用离散化时间的方法把不可中断Job-Shop问题转化为可中断Job-Shop问题,建立该问题的混合整数规划模型,并利用ILOG公司CPLEX软件包对其大规模的可中断Job-Shop问题的算例进行求解,其解可指导冷区的实际生产调度。该模型在实际运用中已取得良好的结果。With regard to the real problem in the production of steel pipes, the feasible idea of transforming Non-preemptive Job-Shop Scheduling Problem into Preemptive Job-Shop Scheduling Problem by slicing time was put forward under the consideration of continuous production, inventory restriction and partial manual scheduling. What’s more, a mixed-integer programming model based on constraints was established and utilizing ILOG CPLEX software package, the answer to this massive PJSSP model can be solved in a relatively rewarding and effective way that can instruct the steel production in real life.

关 键 词：钢管 生产调度 可中断Job-Shop问题 混合整数规划模型 

分 类 号：C935[经济管理—管理学] TP29[自动化与计算机技术—检测技术与自动化装置]