Solving the resource-constrained project scheduling problem by a variable neighborhood search

Article Abstract:

The well-known, challenging problem of resource-constrained project scheduling is reported. A solution scheme based on variable neighborhood search is presented which is coded by using sequences that are valid in terms of precedence constraints.

Scheduling (Management), Neighborhood watch programs, Neighbourhood watch programs

---

Upper and lower bounds for the single source capacitated location problem

Article Abstract:

A Lagrangean heuristics combined with local and tabu search methods are used to study the single source capacitated location problem. The computational results show that the tabu search performed better than local search.

Machine theory, Searching behaviour

---

Improved rounding procedures for the discrete version of the capacitated EOQ problem

Article Abstract:

Frequency based policies to examine the economic order quantity problem in shipping products from origin to destination are presented.

Italy, Methods, Economic aspects, Logistics, Business logistics

Similar abstracts:

• Abstracts: Interdicting the activities of a linear program - a parametric analysis. Dual of the sum of a linear and linear fractional program
• Abstracts: On the inverse problem of linear programming and its application to minimum weight perfect k-matching
• Abstracts: Exploring the characteristics of the market-driven firms and antecedents to sustained competitive advantage. Assessing intelligence as learning within an industrial marketing group: a pilot study
• Abstracts: Adoption of new economy practices by SMEs in Eastern Europe. Derivatives and the non-executive director
• Abstracts: Take the stress out of the sneezing' season with these kid-friendly germ fighters. The stress solution: one small change tremendous benefits

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