A New Heuristic Algorithm

By Serhat OZTURK

As known, it is not possible to develop an algorithm that can compute the exact value of the minimum makespan on identical parallel machines in polynomial time. Therefore heuristic methods are... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3838347315
• ISBN13: 9783838347318
• Release Date: February 2010
• Publisher: LAP Lambert Academic Publishing
• Length: 128 Pages
• Weight: 0.44 lbs.
• Dimensions: 0.3" x 6.0" x 9.0"