带有安装时间以及可分批加工的供应链排序问题  

Supply Chain Scheduling Problems with Setup Times and Batch Scheduling

作　　者：陈立忠[1] 郑琼沂[1] 陈锐[1] 

机构地区：[1]曲阜师范大学管理学院,山东省日照市276826

出　　处：《曲阜师范大学学报（自然科学版）》2013年第2期10-14,共5页Journal of Qufu Normal University(Natural Science)

基　　金：国家自然科学基金(11071142);山东省自然科学基金(ZR2010AM034)

摘　　要：研究了单制造商多客户的供应链排序问题;同一客户的工件可以分批进行加工,不同客户的工件不可以在一批中加工;当相邻的两批工件属于不同客户时则需要相应的安装时间.以生产和运输总费用最小为目标函数,建立了集成排序模型;分别用工件的加权总完工时间和最大延迟作为排序目标,采用动态规划的技巧给出了最优算法,并分析算法复杂性.This paper studies the problem of single manufacture and muhiple customers. Some jobs from the same customer can be processed at the same time; but the jobs from different customers cant be processed in the same batch. When the jobs of adjacent batches belong to different customers, there should be a related setup time. We use total weighted completion time and the maximum lateness as scheduling objective separately. We adopt the technique of dynamical programming to establish the integrated rithms and analyze their complexity. scheduling models. Then we give the optimal algo-

关 键 词：供应链排序 安装时间 动态规划 分批加工 

分 类 号：O226[理学—运筹学与控制论]