A New Solution Seed for Job Shop Scheduling Problem

Abstract:

Article Preview

Scheduling for job shop is very important in both fields of production management and combinatorial optimization. Since the problem is well known as NP-Hard class, many metaheuristic approaches are developed to solve the medium and large scale problems. One of the main elements of these metaheuristics is the solution seed structure. Solution seed represent the coding structure of real solution. In this paper, a new solution seed for job shop scheduling is presented. This solution seed is compared with a famous solution seed presented for the job shop scheduling. Since the problem is well known as NP-Hard class, a Tabu search algorithm is developed to solve large scale problems. The proposed solution seed are examined using an example and tabu search algorithm.

Info:

Periodical:

Edited by:

Wu Fan

Pages:

3899-3905

DOI:

10.4028/www.scientific.net/AMM.110-116.3899

Citation:

P. Fattahi et al., "A New Solution Seed for Job Shop Scheduling Problem", Applied Mechanics and Materials, Vols. 110-116, pp. 3899-3905, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.