By Topic

Managing genetic search in job shop scheduling

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
$33 $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

4 Author(s)
S. Uckun ; Vanderbilt Univ., Nashville, TN, USA ; S. Bagchi ; K. Kawamura ; Y. Miyabe

The Vanderbilt Schedule Optimizer Prototype (VSOP), which uses genetic algorithms as search methods for job shop scheduling problems, is discussed. A job shop is a facility that produces goods according to prespecified process plans, under several domain-dependent and common sense constraints. The scheduling of orders in a job shop is a multifaceted problem. VSOP uses domain-specific chromosome representations, recombination operators, and local enumerative search to increase efficiency. Experimental results from a fully implemented VSOP package are presented.<>

Published in:

IEEE Expert  (Volume:8 ,  Issue: 5 )