Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3994
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.creator | Bertsimas, Dimitris J. | - |
dc.creator | Natarajan, Karthik | - |
dc.creator | Teo, Chung Piaw | - |
dc.date | 2003-12-23T01:59:12Z | - |
dc.date | 2003-12-23T01:59:12Z | - |
dc.date | 2002-01 | - |
dc.date.accessioned | 2013-10-09T02:33:30Z | - |
dc.date.available | 2013-10-09T02:33:30Z | - |
dc.date.issued | 2013-10-09 | - |
dc.identifier | http://hdl.handle.net/1721.1/3994 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
dc.description | We propose a new method, based on semidefinite optimization, to find tight upper bounds on the expected project completion time and expected project tardiness in a stochastic project scheduling environment, when only limited information in the form of first and second (joint) moments of the durations of individual activities in the project is available. Our computational experiments suggest that the bounds provided by the new method are stronger and often significant compared to the bounds found by alternative methods. | - |
dc.description | Singapore-MIT Alliance (SMA) | - |
dc.format | 124719 bytes | - |
dc.format | application/pdf | - |
dc.language | en_US | - |
dc.relation | High Performance Computation for Engineered Systems (HPCES); | - |
dc.subject | project scheduling | - |
dc.subject | problem of moments | - |
dc.subject | semidefinite programming | - |
dc.subject | co-positivity | - |
dc.subject | tardiness | - |
dc.title | Applications of Semidefinite Optimization in Stochastic Project Scheduling | - |
dc.type | Article | - |
Appears in Collections: | MIT Items |
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.