Dr. Mary E. Kurz
  • Home
  • Bio
  • Team
  • Research
  • Publications
  • Click to open the search input field Click to open the search input field Search
  • Menu Menu

Metaheuristics

Condor Use in Industrial Engineering

M.E. Kurz (presenter) “Condor Use in Industrial Engineering”, November 14, 2007. Super Computing 2007 Booth, Reno NV.

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-11-14 00:00:002021-06-21 20:48:53Condor Use in Industrial Engineering

Large-scale Testing for the Design of Genetic Algorithms using High Throughput Computing

Kurz, Mary E. (presenter). “Large-scale Testing for the Design of Genetic Algorithms using High Throughput Computing” November 6, 2007. INFORMS 2007 Conference, Seattle WA.

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-11-06 00:00:002021-06-21 20:49:36Large-scale Testing for the Design of Genetic Algorithms using High Throughput Computing

Enumerating Solutions for an NP-hard Scheduling Problem Using Condor

McElreath, Mark (presenter), Mary E. Kurz, William G. Ferrell, Jr., Priyantha Devapriya.“Enumerating Solutions for an NP-hard Scheduling Problem Using Condor.” November 6, 2007. INFORMS 2007 Conference, Seattle WA.

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-11-06 00:00:002021-06-21 20:49:53Enumerating Solutions for an NP-hard Scheduling Problem Using Condor

A Condor Application: Solving Constrained Facility Layout Problems with Genetic Algorithm

Tayfur, Esengul (presenter), Mary E. Kurz. “A Condor Application: Solving Constrained Facility Layout Problems with Genetic Algorithm.” November 6, 2007. INFORMS 2007 Conference, Seattle WA.

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-11-06 00:00:002021-06-21 20:50:10A Condor Application: Solving Constrained Facility Layout Problems with Genetic Algorithm

Genetic Algorithms for Logistic Regression

Kurz, Mary E. and S.E. Yoder. “Genetic Algorithms for Logistic Regression.” Industrial Engineering Research Conference Proceedings 2007, Nashville TN (CD-ROM).

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-06-23 00:00:002021-06-21 20:27:33Genetic Algorithms for Logistic Regression

Multi-Objective Semiconductor Manufacturing Scheduling: A Random Keys Implementation of NSGA-II

Mason, S.J., Kurz, M.E., Pfund, M.E., Fowler, J.W., and Pohl, L.M. “Multi-Objective Semiconductor Manufacturing Scheduling: A Random Keys Implementation of NSGA-II.” Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 159-164

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-06-23 00:00:002021-06-21 20:28:09Multi-Objective Semiconductor Manufacturing Scheduling: A Random Keys Implementation of NSGA-II

Random keys implementation of NSGA-II for semiconductor manufacturing scheduling

Mason, S.J., Kurz, M.E., Pohl, L.M., Fowler, J.W., Pfund, M.E., 2007, “Random keys implementation of NSGA-II for semiconductor manufacturing scheduling”, International Journal of Information Technology and Intelligent Computing, 2(3).

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2007-05-01 00:00:002021-06-21 20:01:48Random keys implementation of NSGA-II for semiconductor manufacturing scheduling

A Genetic Algorithm for the Earliness/Tardiness Flow Shop Scheduling Problem

Randall, Robert and Mary E. Kurz. “A Genetic Algorithm for the Earliness/Tardiness Flow Shop Scheduling Problem.” Industrial Engineering Research Conference Proceedings 2006, Orlando FL (CD-ROM).

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2006-06-23 00:00:002021-06-21 20:28:31A Genetic Algorithm for the Earliness/Tardiness Flow Shop Scheduling Problem

A Genetic Algorithm with Random-keys Representation for a Symmetric Multi-objective Traveling Salesman Problem

Samanlioglu, F., M. Kurz, and W. Ferrell, Jr. (2006). “A Genetic Algorithm with Random-keys Representation for a Symmetric Multi-objective Traveling Salesman Problem.”Industrial Engineering Research Conference Proceedings 2006, Orlando FL (CD-ROM).

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2006-06-23 00:00:002021-06-21 20:28:50A Genetic Algorithm with Random-keys Representation for a Symmetric Multi-objective Traveling Salesman Problem

Serial Batch Scheduling using an Adaptive Crossover Selection Genetic Algorithm

Randall, Patricia and Mary E. Kurz. “Serial Batch Scheduling using an Adaptive Crossover Selection Genetic Algorithm.” Industrial Engineering Research Conference Proceedings 2006, Orlando FL (CD-ROM).

/wp-content/themes/awp-enfold/blank.png 0 0 Academic Web Pages /wp-content/themes/awp-enfold/blank.png Academic Web Pages2006-06-23 00:00:002021-06-21 20:29:10Serial Batch Scheduling using an Adaptive Crossover Selection Genetic Algorithm
Page 4 of 6«‹23456›»

Pages

  • Bio
  • Home
  • Publications
  • Research
  • Team

Categories

  • Assembly Topics
  • Book Chapters
  • Conference Proceedings
  • Flexible Flowline Data Repository
  • Metaheuristics
  • News
  • Presentations
  • Publications
  • Refereed Journal Publications
  • Research
  • Scheduling Topics
  • Uncategorized

Archive

  • August 2026
  • January 2026
  • March 2025
  • June 2023
  • December 2021
  • September 2021
  • June 2021
  • May 2021
  • December 2019
  • January 2019
industrial engineering

Map

Dr. Mary E. Kurz
Associate Professor
Department of Industrial Engineering
Clemson University
mkurz@clemson.edu

© Copyright Dr. Mary E Kurz. All Rights Reserved. Site by Academic Web Pages
    • Login
    Scroll to top Scroll to top Scroll to top