Analysis of the set of V-shaped schedules

الملخص EN

In this paper the size of the set of V-shaped schedules is investigated when a point is identified to be the change point from nonincreasing to nondecreasing order of job processing times.

More specifically the significance of identifying such a point in reducing the size of the set of V-shaped schedules is investigated.

It is found that the resulting subset of the V-shaped schedules is significantly less than the set of V-shaped schedules.

The reduction is more significant with the increase in the variation in job processing times.

This result encourages researchers to identify the changing point for problems known to have V-shaped optimal schedules.