Abstract
Setup costs are a crucial factor in many branches of industry and frequently sequence dependent. However, the empirical acquisition of setup costs is inaccurate and not practicable for companies with large product portfolios operating in volatile markets. We therefore propose an abstract model for the estimation of such sequence dependent setup costs and subsequently apply dispatching and scheduling strategies to generate optimized production sequences. Both approaches are tested on randomly generated test instances and a real-world production scenario.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Affenzeller, M., Wagner, S.: Offspring selection: A new self-adaptive selection scheme for genetic algorithms. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds.) Adaptive and Natural Computing Algorithms. Springer Computer Series, pp. 218–221. Springer, Heidelberg (2005)
Aggarwal, S.C.: A note on “The influence of setup time on job shop performance” by Wilbrecht and Prescott. Management Science 19(11), 1332–1333 (1972)
Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega International Journal of Management Science 27, 219–239 (1999)
Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187, 985–1032 (2008)
Beham, A., Winkler, S., Wagner, S., Affenzeller, M.: A genetic programming approach to solve scheduling problems with parallel simulation. In: Proceedings of the 22nd IEEE International Parallel & Distributed Processing Symposium (IPDPS 2008). IEEE, Los Alamitos (2008)
Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms, part ii: hybrid genetic search strategies. Computers & Industrial Engineering 36, 343–364 (1999)
Gilmore, P.C., Gomory, R.E.: Sequencing a one-state variable machine; a solvable case of the traveling salesman problem. Operations Research 12, 655–674 (1964)
Holland, J.H.: Adaption in Natural and Artificial Systems. University of Michigan Press (1975)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Wagner, S.: Heuristic Optimization Software Systems - Modeling of Heuristic Optimization Algorithms in the HeuristicLab Software Environment. PhD thesis, Johannes Kepler University, Linz, Austria (2009)
White, C.H., Wilson, R.C.: Sequence dependent set-up times and job sequencing. International Journal of Production Research 15(2), 191–202 (1977)
Wilbrecht, J.K., Prescott, W.B.: The influence of setup time on job shop performance. Management Science 16(4), B274–B280 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kofler, M., Wagner, S., Beham, A., Kronberger, G., Affenzeller, M. (2009). Priority Rule Generation with a Genetic Algorithm to Minimize Sequence Dependent Setup Costs. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2009. EUROCAST 2009. Lecture Notes in Computer Science, vol 5717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04772-5_105
Download citation
DOI: https://doi.org/10.1007/978-3-642-04772-5_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04771-8
Online ISBN: 978-3-642-04772-5
eBook Packages: Computer ScienceComputer Science (R0)