Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆

Title
Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem☆
Authors
Keywords
-
Journal
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume 38, Issue 1-2, Pages 57-67
Publisher
Elsevier BV
Online
2009-05-06
DOI
10.1016/j.omega.2009.04.002

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started