An application of genetic algorithms for flow shop problems

Article Abstract:

A study was conducted to develop a genetic algorithm (GA) based heuristic for application in flow shop problems. Computational results of the heuristic were compared with the results from other existing heuristics. The results showed that the GA-based algorithm is an effective heuristic for flow shop problems. Moreover, it may be used to solve flow shop problems with total flow time, total tardiness, maximum tardiness and other criteria.

Scheduling (Management)

---

A primal partitioning approach for single and non-simultaneous multicommodity flow problems

Article Abstract:

Single and non-simultaneous multicommodity flow problems are resolved using a primal partitioning approach.

Multiphase flow

---

Partitioning under the Lp norm

Article Abstract:

The NP-complete problem with regard to partitioning under the Lp norm is considered.

Usage, Optimization theory, Mathematical programming

Similar abstracts:

• Abstracts: A genetic algorithm for multi-mode resource constrained project scheduling problem
• Abstracts: A simulation analysis of sequencing rules in a flexible flowline. Selecting the CP metric: a risk aversion approach
• Abstracts: A declaration on independents. Stopping soft money. And then, among the also-runnings
• Abstracts: Army on trial. Insecurity forces. Now Aceh takes a beating
• Abstracts: Mexico enters the era of politics. Searching for a livelier role. Mexico's once-ruling party faces the shock of opposition

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