NUDGE, A Knowledge-Based Scheduling Program

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5771

Full metadata record

DC Field	Value	Language
dc.creator	Goldstein, Ira P.	-
dc.creator	Roberts, R. Bruce	-
dc.date	2004-10-01T20:34:39Z	-
dc.date	2004-10-01T20:34:39Z	-
dc.date	1977-02-01	-
dc.date.accessioned	2013-10-09T02:41:14Z	-
dc.date.available	2013-10-09T02:41:14Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-405	-
dc.identifier	http://hdl.handle.net/1721.1/5771	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Traditional 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.	-
dc.format	23 p.	-
dc.format	1889422 bytes	-
dc.format	1477021 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-405	-
dc.title	NUDGE, A Knowledge-Based Scheduling Program	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI