Name
Abstract | ||
|---|---|---|
Between conventional techniques of scheduling and the actual production order sequencing lies a gap which should be bridged to provide a logical system connection between the planning process and the implementation of the shop loading function. Project network techniques, including PERT, generally do not consider the constraints on resources.1,2 It is true that resource utilization can be extracted from a PERT-type schedule. However, there is no guarantee that the amount of resources required for any scheduled interval of time will not exceed the plant capacity, thereby making the schedule invalid. Also, if the demand for resources associated with the PERT schedule fluctuates severely, the resulting schedule may be expensive. These considerations are especially acute when several project networks compete for limited resources. On the other hand, by definition, sequencing techniques provide a feasible loading of the shop.3 However, this loading is usually accomplished at the hazard of ignoring project goals in favor of local (short-term) increases in facility utilization. An exception is discussed in a report by B. Banerjee,4 which is a treatment of a set of project-oriented heuristics for shop sequencing. |
Year | DOI | Venue |
|---|---|---|
1965 | 10.1147/sj.43.0225 | IBM Systems Journal |
Keywords | Field | DocType |
limited facility,useful alteration,resulting schedule,part v production order,higher scheduling junction,assembly operation,global property,project network,priority function | Network on,Systems engineering,Computer science,Scheduling (computing),Project network,Fabrication,Project networks | Journal |
Volume | Issue | ISSN |
4 | 3 | 0018-8670 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. B. Calica | 1 | 0 | 0.68 |