A genetic algorithm for multi-mode resource constrained project scheduling problem

Article Abstract:

A genetic algorithm was developed for solving a class of nonpreemptive multi-mode resource-constrained project scheduling problem involving an activity that can be performed in duration or resource requirements. The genetic algorithm for multi-mode resource-constrained project scheduling problem incorporates the problem-specific knowledge of the application domain to form a non-standard representational scheme. The introduction of the expanded representation also required the definition of new domain-dependent crossover and mutation operators.

Linear programming

---

Multi-resource shop scheduling with resource flexibility

Article Abstract:

A shop scheduling problem is presented characterized by multi-resource processing, resource flexibility and non-linear routings. The problem involves operations that require multiple resources to be undertaken. It also takes into consideration an operation that may probably have more than one predecessor and/ or successor on the routing. A neighborhood structure that can be utilized to obtain a local search algorithm, such as tabu search, was created.

Analysis, Heuristic, Heuristics (Psychology)

---

Similar abstracts:

• Abstracts: Genetic algorithm approach on multi-criteria minimum spanning tree problem. Continuity of minimal points with applications to parametric multiple objective optimizations
• Abstracts: Building strategy on technological resources and commercial proactiveness: the Gemplus Case. Quo Vadis, Automotive industry? A vision of possible industry transformations
• Abstracts: A shrunken cyclic inspection schedule for deteriorating production stages. A note on the rule for sequential selection

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