Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Other
Authors: González, Miguel A.
Affiliations: Computing Technologies Group, Department of Computing, Artificial Intelligence Center, University of Oviedo, Campus of Viesques, 33271 Gijón, Spain. E-mail: mig@uniovi.es
Abstract: In this dissertation, we propose solving methods for the job shop scheduling problem with sequence-dependent setup times, considering four different objective functions. The formal properties of the problem are studied. Two new neighborhood structures are proposed, with their respective feasibility and non-improving conditions, as well as an algorithm for fast neighbors' cost estimation. These structures are embedded in local search procedures, and their hybridization with a genetic algorithm is also studied. The experimental results show that the proposed methods obtain excellent results, improving in many cases the state of the art.
Keywords: Job shop scheduling, setup times, genetic algorithm, local search
DOI: 10.3233/AIC-130571
Journal: AI Communications, vol. 26, no. 4, pp. 419-421, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl