By Topic

Some results on neighbor robustness of an optimal schedule

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li Jiangeng ; Sch. of Electr. Information & Control Eng., Beijing Univ. of Technol., China ; Qiao Junfei ; Yang Ming

The robustness of a schedule is an important problem in practice. In this paper it is studied in the angle that the optimal schedules do not change. Firstly, the neighbor robustness of an optimal schedule is defined, that is the property that an optimal schedule keeps the same when some of the parameters (considered as a point in the responding hyperspace) in the scheduling problem vary in one of its neighbors. Then the results in this paper are proved. The results are: for a problem with continuous objective its strictly optimal schedule is of neighbor robustness, and for single machine total weighted completion time problem its optimal schedule is of neighbor robustness with probability of 1. Some discussion and examples are given.

Published in:

Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on  (Volume:4 )

Date of Conference:

15-19 June 2004