Please use this identifier to cite or link to this item:
|Web of Science®
|Minimizing impact of bounded uncertainty on McNaughton's scheduling algorithm via interval programming
|Conference proceedings / IEEE International Conference on Systems, Man, and Cybernetics. IEEE International Conference on Systems, Man, and Cybernetics, 2013, pp.970-976
|IEEE International Conference on Systems Man and Cybernetics Conference Proceedings
|2013 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2013) (13 Oct 2013 - 16 Oct 2013 : Manchester, UK)
|Ahmad Hossny, Saeid Nahavandi, Douglas Creighton
|Uncertainty of data affects decision making process as it increases the risk and the costs of the decision. One of the challenges in minimizing the impact of the bounded uncertainty on any scheduling algorithm is the lack of information, as only the upper bound and the lower bound are provided without any known probability or membership function. On the contrary, probabilistic uncertainty can use probability distributions and fuzzy uncertainty can use the membership function. McNaughton's algorithm is used to find the optimum schedule that minimizes the make span taking into consideration the preemption of tasks. The challenge here is the bounded inaccuracy of the input parameters for the algorithm, namely known as bounded uncertain data. This research uses interval programming to minimise the impact of bounded uncertainty of input parameters on McNaughton's algorithm, it minimises the uncertainty of the cost function estimate and increase its optimality. This research is based on the hypothesis that doing the calculations on interval values then approximate the end result will produce more accurate results than approximating each interval input then doing numerical calculations.
|Scheduling uncertainty; interval programming; interval arithmetic
|© 2013 IEEE
|Appears in Collections:
|Aurora harvest 8
Mathematical Sciences publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.