Towards engineer-to-order product configuration

  1. (PDF, 239 KB)
AuthorSearch for: ; Search for:
Conference15th International Conference on Computer Application in Industry and Engineering: 01 November 2002, San Diego, CA.
Pages15; # of pages: 5
Subjectengineer-to-order; product configuration; constraint satisfaction; search algorithms; repair-based heuristic
AbstractThis paper presents a system that uses robust, genetic algorithms for solving job shop scheduling problems. The system uses the algorithms to evolve an appropriate permutation for dispatching rules and batch sizes with an encode-decode strategy. It then uses a non-delay heuristic algorithm to construct a feasible solution according to the permutation. The algorithms take into consideration not only job processing time but also setup time and offers good potential for reducing work in progress, an essential factor for production planning.
Publication date
AffiliationNRC Institute for Research in Construction; National Research Council Canada
Peer reviewedYes
NRC number19269
NPARC number20377851
Export citationExport as RIS
Report a correctionReport a correction
Record identifier2c3064b8-3253-482d-a9c9-81354e0c70f1
Record created2012-07-24
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)