Show simple item record

dc.contributor.authorGoldstein, Ira P.en_US
dc.contributor.authorRoberts, R. Bruceen_US
dc.date.accessioned2004-10-01T20:34:39Z
dc.date.available2004-10-01T20:34:39Z
dc.date.issued1977-02-01en_US
dc.identifier.otherAIM-405en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5771
dc.description.abstractTraditional scheduling algorithms (using the techniques of PERT charts, decision analysis or operations research) require well-defined quantitative, complete sets of constraints. They are insufficient for scheduling situations where the problem description is ill-defined, involving incomplete, possibly inconsistent and generally qualitative constraints. The NUDGE program uses an extensive knowledge base to debug scheduling requests by supplying missing details and resolving minor inconsistencies. The result is that an informal request is converted to a complete description suitable for a traditional scheduler.en_US
dc.format.extent23 p.en_US
dc.format.extent1889422 bytes
dc.format.extent1477021 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-405en_US
dc.titleNUDGE, A Knowledge-Based Scheduling Programen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record