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

Study on Genetic Algorithms Approach Applied to the Capacitated Disassembly Scheduling Problem

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen WeiDa ; Sch. of Econ. & Manage., Southeast Univ., Nanjing, China ; Huang Sheng ; Gao Nan

This paper analyzes the capacitated disassembly scheduling problem, in which the limitations of multiple resources, overtime considerations and corresponding resources required for setup are taken into account explicitly. A genetic algorithm is proposed by making use of the problem-specific knowledge in which only the binary variables for the setup patterns of root items are encoded and a two-stage procedure is presented as the decoding scheme. Results of computational experiments on randomly generated test problems indicate that the heuristic genetic algorithm gives the optimal solutions to all test problems in a very short amount of computation time.

Published in:

E-Business and E-Government (ICEE), 2010 International Conference on

Date of Conference:

7-9 May 2010

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.