Rescheduling Problems with Bicriteria  

两个目标的重新排序问题(英文)

作　　者：慕运动 

机构地区：[1]Department of Mathematics and Physics,Henan University of Technology [2]Department of Mathematics,Zhengzhou University

出　　处：《Chinese Quarterly Journal of Mathematics》2009年第3期349-356,共8页数学季刊（英文版）

基　　金：Supported by the NSFC(10671183);Supported by the Science Foundation of Henan University of Technology(07XJC002);Supported by the NSF of the Education Department of Henan Province(2008A11004);Supported by the NSF of Henan Province(082300410190)

摘　　要：In the rescheduling on a single machine,a set of original jobs has already been scheduled to minimize some cost objective,when a new set of jobs arrives and creates a disruption.The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it.In this paper,we consider hierarchical optimization between the scheduling cost of all the jobs and the degree of this disruption.For every problem,we provide either a polynomial time algorithm or an intractable result.

关 键 词：RESCHEDULING hierarchical optimization time disruption sequence disruption single machine 

分 类 号：O157.5[理学—数学] F249.214[理学—基础数学]