caa a22 4500 445359684 CHVBK 20180317142911.0 cr unu---uuuuu 170323e20110901xx s 000 0 eng 10.1007/s10100-010-0162-7 doi (NATIONALLICENCE)springer-10.1007/s10100-010-0162-7 Job scheduling with forbidden setups and two objectives using genetic algorithms and penalties [Elektronische Daten] A case study at a continuous casting plant [Karsten Hentsch, Peter Köchel] One of the most important tasks in service and manufacturing systems is how to schedule arriving jobs such that some criteria will be satisfied. Up to now there have been defined a great variety of scheduling problems as well as corresponding models and solution approaches. Most models suffer from such more or less restrictive assumptions like single machine, unique processing times, zero set-up times or a single criterion. On the other hand some classical approaches like linear or dynamic programming are practicable for small-size problems only. Therefore over the past years we can observe an increasing application of heuristic search methods. But scheduling problems with multiple machines, forbidden setups and multiple objectives are scarcely considered. In our paper we apply a Genetic Algorithm to such a problem which was found at a continuous casting plant. Because of the forbidden setups the probability for a random generated schedule to be feasible is nearly zero. To resolve this problem we use three kinds of penalties, a global, a local and a combined approach. For performance investigations of these penalty types we applied our approaches to a real world test instance with 96 jobs, three machines and two objectives. We tested five different penalty levels with 51 independent runs to evaluate the impact of the penalties. Springer-Verlag, 2010 Scheduling nationallicence Constraints nationallicence Forbidden setups nationallicence Penalties nationallicence Genetic algorithm nationallicence Hentsch Karsten Department of Computer Science, Chemnitz University of Technology, Straße der Nationen 62, 09107, Chemnitz, Germany aut Köchel Peter Department of Computer Science, Chemnitz University of Technology, Straße der Nationen 62, 09107, Chemnitz, Germany aut Central European Journal of Operations Research Springer-Verlag 19/3(2011-09-01), 285-298 1435-246X 19:3<285 2011 19 10100 https://doi.org/10.1007/s10100-010-0162-7 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10100-010-0162-7 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Hentsch Karsten Department of Computer Science, Chemnitz University of Technology, Straße der Nationen 62, 09107, Chemnitz, Germany aut NATIONALLICENCE 700 1- Köchel Peter Department of Computer Science, Chemnitz University of Technology, Straße der Nationen 62, 09107, Chemnitz, Germany aut NATIONALLICENCE 773 0- Central European Journal of Operations Research Springer-Verlag 19/3(2011-09-01), 285-298 1435-246X 19:3<285 2011 19 10100 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer