題  目：A  Branch-and-Price Algorithm for Two-agent Scheduling on Unrelated Parallel Machines with Total Completion Time and Weighted Number of Tardy Jobs Criteria

報告人：殷允強        昆明理工大學(xué) 教授       
時  間：2017年9月8日（星期五） 10:00-11:00??
地  點：江寧校區(qū)經(jīng)管學(xué)院辦公樓704室
講座內(nèi)容：
   This talk considers a two-agent scheduling problem in which each agent has a set of jobs competing with the other agent's for the use of m unrelated parallel machines. Each agent desires to minimize a certain scheduling criterion related to the completion times of its jobs.    The overall objective is to minimize the total completion time of the jobs of one agent, while keeping the weighted number of tardy jobs of the other agent within a given limit. We introduce a novel column generation approach for this problem to keep stabilization and embed it into a branch-and-price procedure. A greedy heuristic is used to obtain a set of initial columns to start the in-out column generation. The pricing subproblem in the column generation is formulated as a single-machine scheduling problem solved using dynamic programming techniques.  An efficient branching strategy compatible with the pricing subproblems is also proposed. Extensive computational results using randomly generated data demonstrate superior performance of this branch-and-price procedure to the standard method.
報告人簡介：
殷允強，昆明理工大學(xué)數(shù)據(jù)科學(xué)研究中心主任、教授、博士、博士生導(dǎo)師。2009年畢業(yè)于北京師范大學(xué)數(shù)學(xué)科學(xué)學(xué)院應(yīng)用數(shù)學(xué)專業(yè)并獲博士學(xué)位，2014年破格晉升為教授，2014-2016年連續(xù)入選愛思唯爾發(fā)布的中國高被引學(xué)者榜單，2015年入選云南省中青年學(xué)術(shù)和技術(shù)帶頭人后備人才計劃?，F(xiàn)擔任昆明理工大學(xué)學(xué)術(shù)委員會委員，中國運籌學(xué)會排序?qū)I(yè)委員會理事，中國運籌學(xué)會醫(yī)療運作管理分會理事，曾擔任兩個SCI 期刊特邀專題的Lead Guest Editor。殷允強教授長期致力于生產(chǎn)和物流運作管理領(lǐng)域的研究并取得了豐碩的研究成果，在NRL、Omega、EJOR、IJPE、IJPR、COR、JOS、IEEE Transactions on SMC等國際主流期刊發(fā)表SCI論文70余篇，其中SCI他引700多次，有4篇論文進入ESI高被引榜單。主持國家自然科學(xué)基金項目3項，中國博士后面上資助項目1項，其他省部級課題多項。