A framework for an interactive project scheduling system under limited resources

Article Abstract:

A framework for an interactive project scheduling system in a resource-constrained environment is suggested. A modelling module enables the decision maker (DM) to generate his/her own model. The performance criteria include the maximization of the net present value and either the minimization of maximum lateness or the minimization of the project duration. The scheduling module is constructed from a constraint-based scheduling algorithm (CBSA). The decisions are reached by activating relevant essential conditions in CBSA and in cases where the resource conflicts are not resolved, the DM obtains a final decision by testing the alternatives suggested by CBSA through a what-if process.

---

Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

Article Abstract:

The parallel and serial scheduling approach for the classical resource-constrained project scheduling problem is analyzed. Theoretical results on the class of schedules generated by each approach are shown. An in-depth computational study is also made to examine the relationship of single-pass scheduling and sampling for both methods. Findings reveal that the performance-ranking of priority rules does not differ for single-pass scheduling and sampling, that sampling enhances the performance of single-pass scheduling substantially and that the parallel approach cannot be generally considered as the best.

---

DAGEN: a generator of testsets for project activity nets

Article Abstract:

The technique and the relevant software used for constructing source-terminal directed project nets of specified number of nodes, number of activities, complexity index (CI) and ranges of costs and resources utilization, are presented. A three-step process is used. A skeleton network of the specified CI is first developed. Then, the modules of extra nodes and arcs are inserted sequentially in either the skeleton or the latest network at hand so that the CI of the resulting network is unchanged. The values of the different parameters are then added. A FORTRAN-77 program was used to automate the process.

Methods, Network analysis (Planning)

Similar abstracts:

• Abstracts: Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers. System delay versus system content for discrete-time queueing systems subject to server interruptions
• Abstracts: Cash-flush Korean conglomerates are recasting themselves as innovators. Malaysia's crocodile sorcerers find they no longer need apprentices
• Abstracts: Ontario's highway 407 RFP. China power projects deliver high voltage shocks. Sao Paulo roads put out to tender
• Abstracts: Pricing, routing, and incentive compatibility in multiserver queues. Performance bounds on multiserver exponential tandem queues with finite buffers
• Abstracts: Sheila Kurtz: handwriting detective. Mending friendships. Diary therapy

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.