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.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

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.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Partitioning under the Lp norm

Article Abstract:

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

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: