The permutation flow shop with buffers: a tabu search approach

Article Abstract:

A study on the criteria of makespan minimization for the permutation flow shop problem with buffers that has limited capacity in between successive machines, a problem that generalizes the classic flow shop problem in manufacturing, was conducted. This resulted in a proposition of an algorithm using a non-trivial generalization of the block elimination properties that is capable of achieving remarkable results.

Manufacturing processes, Manufacturing

---

Dual-based approach for a hub network design problem under non-restrictive policy

Article Abstract:

Research is presented concerning the determination of all hub locations in order to facilitate the construction of a hub network design problem where non-stop service occurs. A dual-based solution is tested and discussed.

Integer programming, Transportation, Industrial locations, Industrial location

---

Reliability optimization of a series system with multiple-choice and budget constraints

Article Abstract:

Research is presented concerning the analysis of a reliability optimization problem for a system featuring multiple-choice constraints. The development of a branch-and-bound solution algorithm is discussed.

Branch and bound algorithms

Similar abstracts:

• Abstracts: The multiobjective equilibrium network design problem revisited: a simulated annealing approach. Siting noxious facilities under uncertainty
• Abstracts: The German market for baby care. The French market for hair care
• Abstracts: An interactive procedure for multiple attribute group decision making with incomplete information: range-based approach
• Abstracts: India's multiplex stocks offer a ticket to Bollywood profits. Hollywood gives rookie directors their big break
• Abstracts: The German market for wine. Wine in Spain

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