NUDGE, A Knowledge-Based Scheduling Program
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, possi...
Main Authors: | , |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/5771 |
_version_ | 1826208340659666944 |
---|---|
author | Goldstein, Ira P. Roberts, R. Bruce |
author_facet | Goldstein, Ira P. Roberts, R. Bruce |
author_sort | Goldstein, Ira P. |
collection | MIT |
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. |
first_indexed | 2024-09-23T14:04:13Z |
id | mit-1721.1/5771 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T14:04:13Z |
publishDate | 2004 |
record_format | dspace |
spelling | mit-1721.1/57712019-04-11T04:46:09Z NUDGE, A Knowledge-Based Scheduling Program Goldstein, Ira P. Roberts, R. Bruce 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. 2004-10-01T20:34:39Z 2004-10-01T20:34:39Z 1977-02-01 AIM-405 http://hdl.handle.net/1721.1/5771 en_US AIM-405 23 p. 1889422 bytes 1477021 bytes application/postscript application/pdf application/postscript application/pdf |
spellingShingle | Goldstein, Ira P. Roberts, R. Bruce NUDGE, A Knowledge-Based Scheduling Program |
title | NUDGE, A Knowledge-Based Scheduling Program |
title_full | NUDGE, A Knowledge-Based Scheduling Program |
title_fullStr | NUDGE, A Knowledge-Based Scheduling Program |
title_full_unstemmed | NUDGE, A Knowledge-Based Scheduling Program |
title_short | NUDGE, A Knowledge-Based Scheduling Program |
title_sort | nudge a knowledge based scheduling program |
url | http://hdl.handle.net/1721.1/5771 |
work_keys_str_mv | AT goldsteinirap nudgeaknowledgebasedschedulingprogram AT robertsrbruce nudgeaknowledgebasedschedulingprogram |