Branch and bound crossed with GA to solve hybrid flowshops

Article Abstract:

An enhanced branch and bound algorithm was formulated to resolve a k-stage hybrid flowshop scheduling problem. The algorithm, which was originally proposed by Brah and Hunsucker, involves the use of a much improved upper bound value through introduction of numerous heuristics at the initial stage of the search. The heuristics introduced are then utilized to compute an initial upper bound and genetic algorithm (GA). Application of the algorithm yielded an enhanced criterion value and an attainable optimality.

---

A variant of time minimizing assignment problem

Article Abstract:

An algorithm based on lexicographic search approach was created to address a time minimizing assignment problem (TMAP) that deals with designation of n jobs to m persons. The algorithm particularly aims to determine viable assignment that lessens the total time for completing all the jobs. It utilizes a heuristic approach in scheduling theory for processing jobs on parallel machines lessening the makespan to obtain initial feasible assignment.

---

Distribution network optimization: finding the most economic solution by using genetic algorithms

Article Abstract:

An approach based on genetic algorithms was formulated to address a problem associated with finding the optimal diameters of pipelines and accessories in distribution networks. The approach was a result of a model developed to illustrate the problem through the help of directed acyclic graphs. The approach eliminates the amount of time needed to comprehend the network and to fix its various characteristics.

Pipelines, not elsewhere classified, Pipelines NEC, All Other Pipeline Transportation, Pipelines, Structural optimization

Similar abstracts:

• Abstracts: A diagnostic test for the distribution-free efficiency estimator: an example using U.S. commercial bank data. Measuring efficiency at U.S. banks: accounting for heterogeneity is important
• Abstracts: Optimal allocation of simulation experiments in discrete stochastic optimization and approximative algorithm. Stochastic gradient algorithm with random truncations
• Abstracts: Currency remains a worry, with hedging seen as answer. Devaluation of Yuan isn't likely to be in the cards. Peg for local currency is tested by region's crisis: city faces more pressure to devalue its dollar as neighbors appear a better investment bargain
• Abstracts: Firms jump on telephony bandwagon to cut phone bills. Telstra is looking to join a global telecom alliance
• Abstracts: Overcapacity is a basic woe. Slow growth, falling stocks spur ownership shuffles

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