Minimizing bounded uncertainty impact on scheduling with earliest start and due-date constraints via interval computation
Hossny, Ahmad, Nahavandi, Saeid and Creighton, Douglas 2012, Minimizing bounded uncertainty impact on scheduling with earliest start and due-date constraints via interval computation, in ETFA 2012 : Proceedings of the 2012 17th IEEE International Conference on Emerging Technologies & Factory Automation, IEEE, Piscataway, N.J., pp. 1-4.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Minimizing bounded uncertainty impact on scheduling with earliest start and due-date constraints via interval computation
Bounded 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.
ISBN
9781467347372
Language
eng
Field of Research
010101 Algebra and Number Theory 010206 Operations Research
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.