Maintaining project networks in automated artificial intelligence planning

Article Abstract:

Many managers have used program evaluation research task chart tools to assist them in the project planning process, but a tool that can also be used is an artificial intelligence automated plan synthesis program (AI planner). The AI planner is focused on creating a project plan instead of computing properties of an existing project plan. There are a number of reasons why managers may benefit from knowledge of AI planners including: the possibility of selecting properties of AI planners to incorporate in a knowledge-based program for complicated scheduling environments; the potential direct use in an application domain; and the potential need to build planning abilities into autonomous agents, such as robots. To provide additional information about AI planners, an introduction to AI planners is presented, and aspects of knowledge representation are discussed.

Management, Planning, Artificial intelligence, Machine shops, Production planning

---

On competition to join a simple queueing system before the facility opens

Article Abstract:

A queue for a service provider that operates on a strict first-in, first-out basis is analyzed for the benefit of service requestors entering the queue; the equations and models developed study service value received, offset by waiting time in the queue. The model demonstrates that highly self-interested service requestors, who arrive at the queue before the service provider is accepting requests (before the work day begins), create competition and realize minimal benefit, since the waiting time (and costs associated therewith) is increased. The model further demonstrates that service requestors cannot improve on the time-cost benefits accruing from arriving just at the time the service provider begins accepting requests for service (the start of the work day).

Network analysis (Planning), Mathematical optimization, Optimization theory, Equilibrium

---

Patience is a virtue in a simple model of repetitively joining a queue

Article Abstract:

The rewards of service completion must be weighed by all members of a finite customer population against the cost of waiting in a single exponential server queuing system. Customers may re-enter the system after the service is completed. The customers must make a single decision in trying to maximize average return per unit time over an infinite horizon: a choice of arrival rate that must then be used to find the time until re-entry whenever customers finish being served.

Customer service, Mathematical analysis, Equilibrium (Economics)

Similar abstracts:

• Abstracts: Integrating neural networks and semi-Markov processes for automated knowledge acquisition: an application to real-time scheduling
• Abstracts: Gainsharing and mutual monitoring: a combined agency-organizational justice interpretation. Ramping up the organizational learning curve: Assessing the impact of deliberate learning on organizational performance under gainsharing
• Abstracts: Finding Certain Weakly-Efficient Vertices in Multiple Objective Linear Fractional Programming. Multiple Objective Linear Programming with Parametric Criteria Coefficients
• Abstracts: Arbitrating a dispute: a decision analytic approach. The innovation diffusion process in a heterogeneous population: a micromodeling approach
• Abstracts: M-labeled digraphs: an aid to the use of structural and simulation models. M-Labeled Digraphs: An Aid to the Use of Structural and Simulation Models

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