Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach

Research output: Contributions to collected editions/worksArticle in conference proceedingsResearchpeer-review

Standard

Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach. / Hildebrandt, Torsten; Heger, Jens; Scholz-Reiter, Bernd.
Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10. New York: Association for Computing Machinery, Inc, 2010. p. 257-264.

Research output: Contributions to collected editions/worksArticle in conference proceedingsResearchpeer-review

Harvard

Hildebrandt, T, Heger, J & Scholz-Reiter, B 2010, Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach. in Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10. Association for Computing Machinery, Inc, New York, pp. 257-264, 12th Annual Genetic and Evolutionary Computation Conference - 2010, Portland, Oregon, United States, 07.07.10. https://doi.org/10.1145/1830483.1830530

APA

Hildebrandt, T., Heger, J., & Scholz-Reiter, B. (2010). Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach. In Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 (pp. 257-264). Association for Computing Machinery, Inc. https://doi.org/10.1145/1830483.1830530

Vancouver

Hildebrandt T, Heger J, Scholz-Reiter B. Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach. In Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10. New York: Association for Computing Machinery, Inc. 2010. p. 257-264 doi: 10.1145/1830483.1830530

Bibtex

@inbook{1c5ce7449de54ac7aba4a66fcdd25bf4,
title = "Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach",
abstract = "Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and objectives automatic rule search mechanism are investigated. In this paper an approach using Genetic Programming (GP) is presented. The priority rules generated by GP are evaluated on dynamic job shop scenarios from literature and compared with manually developed rules yielding very promising results also interesting for Simulation Optimization in general.",
keywords = "Dispatching rules, Genetic programming, Job shop scheduling, Stochastic system optimization, Engineering",
author = "Torsten Hildebrandt and Jens Heger and Bernd Scholz-Reiter",
year = "2010",
doi = "10.1145/1830483.1830530",
language = "English",
isbn = "978-1-4503-0072-8",
pages = "257--264",
booktitle = "Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10",
publisher = "Association for Computing Machinery, Inc",
address = "United States",
note = "12th Annual Genetic and Evolutionary Computation Conference - 2010, 12th Annual GECCO - 2010 ; Conference date: 07-07-2010 Through 11-07-2010",
url = "http://www.sigevo.org/gecco-2010/",

}

RIS

TY - CHAP

T1 - Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach

AU - Hildebrandt, Torsten

AU - Heger, Jens

AU - Scholz-Reiter, Bernd

N1 - Conference code: 12

PY - 2010

Y1 - 2010

N2 - Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and objectives automatic rule search mechanism are investigated. In this paper an approach using Genetic Programming (GP) is presented. The priority rules generated by GP are evaluated on dynamic job shop scenarios from literature and compared with manually developed rules yielding very promising results also interesting for Simulation Optimization in general.

AB - Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and objectives automatic rule search mechanism are investigated. In this paper an approach using Genetic Programming (GP) is presented. The priority rules generated by GP are evaluated on dynamic job shop scenarios from literature and compared with manually developed rules yielding very promising results also interesting for Simulation Optimization in general.

KW - Dispatching rules

KW - Genetic programming

KW - Job shop scheduling

KW - Stochastic system optimization

KW - Engineering

UR - http://www.scopus.com/inward/record.url?scp=77955890955&partnerID=8YFLogxK

U2 - 10.1145/1830483.1830530

DO - 10.1145/1830483.1830530

M3 - Article in conference proceedings

AN - SCOPUS:77955890955

SN - 978-1-4503-0072-8

SP - 257

EP - 264

BT - Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

PB - Association for Computing Machinery, Inc

CY - New York

T2 - 12th Annual Genetic and Evolutionary Computation Conference - 2010

Y2 - 7 July 2010 through 11 July 2010

ER -

DOI

Recently viewed

Publications

  1. Mapping interest rate projections using neural networks under cointegration
  2. Switching from a Managing to a Monitoring Function on the Board
  3. Towards a Dynamic Interpretation of Subjective and Objective Values
  4. Performance analysis for loss systems with many subscribers and concurrent services
  5. Using mixture distribution models to test the construct validity of the Physical Self-Description Questionnaire
  6. Effectiveness of a guided multicomponent internet and mobile gratitude training program - A pragmatic randomized controlled trial
  7. Study on the effects of tool design and process parameters on the robustness of deep drawing
  8. A Proposal for Integrating Theories of Complexity for Better Understanding Global Systemic Risks
  9. Model-based logistic controlling of converging material flows
  10. A Cross-Classified CFA-MTMM Model for Structurally Different and Nonindependent Interchangeable Methods
  11. Anomaly detection in formed sheet metals using convolutional autoencoders
  12. Reading and Calculating in Word Problem Solving
  13. Challenges and boundaries in implementing social return on investment
  14. Machine Learning and Knowledge Discovery in Databases
  15. Challenges in detecting proximal effects of existential threat on lie detection accuracy
  16. Lyapunov stability analysis to set up a PI controller for a mass flow system in case of a non-saturating input
  17. »HOW TO MAKE YOUR OWN SAMPLES«
  18. Changing Data Collection Methods Means Different Kind of Data
  19. Design of controllers applied to autonomous unmanned aerial vehicles using software in the loop
  20. Exploration strategies, performance, and error consequences when learning a complex computer task
  21. How, when and why do negotiators use reference points?
  22. There is no Software, there are just Services: Introduction
  23. Use of Machine-Learning Algorithms Based on Text, Audio and Video Data in the Prediction of Anxiety and Post-Traumatic Stress in General and Clinical Populations
  24. Constraint breeds creativity
  25. A computational study of a model of single-crystal strain-gradient viscoplasticity with an interactive hardening relation
  26. Lyapunov Convergence Analysis for Asymptotic Tracking Using Forward and Backward Euler Approximation of Discrete Differential Equations
  27. Sensor Fusion for Power Line Sensitive Monitoring and Load State Estimation
  28. Combining multiple investigative approaches to unravel functional responses to global change in the understorey of temperate forests
  29. From "cracking the orthographic code" to "playing with language"