Cart (Loading....) | Create Account
Close category search window
 

Multiobjective Job Shop Scheduling using Genetic Algorithm with Cyclic Fitness Assignment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Tsung-Che Chiang ; Nat. Taiwan Univ., Taipei ; Li-Chen Fu

A job shop scheduling problem with total tardiness and the maximum tardiness as objectives is addressed. We solve it by a rule-coded genetic algorithm. Characteristics of three existing fitness assignment mechanisms are identified and then combined through the proposed cyclic fitness assignment mechanism. Experiments are conducted on a public benchmark problem set, and the results show that the proposed algorithm outperforms the existing ones.

Published in:

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Date of Conference:

0-0 0

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.