File(s) under permanent embargo
Minimizing bounded uncertainty impact on scheduling with earliest start and due-date constraints via interval computation
conference contribution
posted on 2012-01-01, 00:00 authored by A Hossny, Saeid Nahavandi, Douglas CreightonDouglas CreightonBounded uncertainty is a major challenge to real life scheduling as it increases the risk and cost depending on the objective function. Bounded uncertainty provides limited information about its nature. It provides only the upper and the lower bounds without information in between, in contrast to probability distributions and fuzzymembership functions. Bratley algorithm is usually used for scheduling with the constraints of earliest start and due-date. It is formulated as . The proposed research uses interval computation to minimize the impact of bounded uncertainty of processing times on Bratley’s algorithm. It minimizes the uncertainty of the estimate of the objective function. The proposed concept is to do the calculations on the interval values and approximate the end result instead of approximating each interval then doing numerical calculations. This methodology gives a more certain estimate of the objective function.
History
Event
IEEE Emerging Technologies & Factory Automation. Conference (17th : 2012 : Krakow, Poland)Pagination
1 - 4Publisher
IEEELocation
Krakow, PolandPlace of publication
Piscataway, N.J.Start date
2012-09-17End date
2012-09-21ISBN-13
9781467347372Language
engPublication classification
E1 Full written paper - refereedTitle of proceedings
ETFA 2012 : Proceedings of the 2012 17th IEEE International Conference on Emerging Technologies & Factory AutomationUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC