两个目标的重新排序问题

数学季刊 ›› 2009, Vol. 24 ›› Issue (3): 349-356.

两个目标的重新排序问题

Department of Mathematics and Physics, Henan University of Technology Department of Mathematics, Zhengzhou University

收稿日期:2006-05-23 出版日期:2009-09-30 发布日期:2023-06-27
作者简介:MU Yun-dong(1965- ), male, native of Weishi, Henan, an associate professor of Henan University of Technology, Ph.D., engages in combinatorial optimization.
基金资助:
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)；

Rescheduling Problems with Bicriteria

Department of Mathematics and Physics, Henan University of Technology Department of Mathematics, Zhengzhou University

Received:2006-05-23 Online:2009-09-30 Published:2023-06-27
About author:MU Yun-dong(1965- ), male, native of Weishi, Henan, an associate professor of Henan University of Technology, Ph.D., engages in combinatorial optimization.
Supported by:
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)；

摘要/Abstract

摘要： 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

Abstract: 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.

Key words: rescheduling, hierarchical optimization, time disruption, sequence disruption;
single machine

中图分类号:

O223

慕运动. 两个目标的重新排序问题[J]. 数学季刊, 2009, 24(3): 349-356.

MU Yun-dong. Rescheduling Problems with Bicriteria [J]. Chinese Quarterly Journal of Mathematics, 2009, 24(3): 349-356.