nach oben

Erschienen in:

2016 | OriginalPaper | Buchkapitel

4. A Free-Slack-Based Genetic Algorithm for the Robotic Cell Problem with Controllable Processing Times

verfasst von : Mohammed Al-Salem, Mohamed Haouari, Mohamed Kharbeche, Wael Khallouli

Erschienen in: Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We present a novel genetic algorithm for the Robotic Cell Problem with controllable processing times. This challenging problem arises in an automated production cell that consists of m consecutive machines as well as a material handling robot. The problem requires finding the operations processing times, job assignment, and robot movements. The objective is to minimize the makespan subject to a budget constraint. We describe a free-slack-based genetic algorithm for the linear resource consumption case. We present the results of a computational study and we provide evidence that the proposed algorithm consistently outperforms MIP-based heuristics from the literature.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Stochastic Scheduling for a Network of Flexible Job Shops

Nächstes Kapitel Metaheuristic for Randomized Priority Search (Meta-RaPS): A Tutorial

Akturk MS, Ilhan T (2011) Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness. Comput Oper Res 38(4):771–781CrossRef

Al-Salem M, Kharbeche M, Khallouli W, Haouari M (2015) Mip-based heuristics for the robotic cell problem with controllable processing times. Technical Report, CENG/MIE, Qatar University

Biskup D, Cheng TCE (1999) Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Eng Optim 31(3):329–336CrossRef

Carlier J, Haouari M, Kharbeche M, Aziz M (2010) An optimization-based heuristic for the robotic cell problem. Eur J Oper Res 202(3):636–645CrossRef

Dawande MW, Geismar HN, Sethi SP, Chelliah S (2007) Throughput optimization in robotic cells, vol 101. Springer, New York

Janiak A (1991) Single machine scheduling problem with a common deadline and resource dependent release dates. Eur J Oper Res 53(3):317–325CrossRef

Kharbeche M, Carlier J, Haouari M, Aziz M (2011) Exact methods for the robotic cell problem. Flex Serv Manuf J 23(2):242–261CrossRef

Koulamas C, Gupta S, Kyparisis GJ (2010) A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times. Eur J Oper Res 205(2):479–482CrossRef

Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155(13):1643–1666CrossRef

Wang J-B, Xia Z-Q (2007) Single machine scheduling problems with controllable processing times and total absolute differences penalties. Eur J Oper Res 177(1):638–645CrossRef

Xu K, Feng Z, Keliang J (2010) A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. Comput Oper Res 37(11):1924–1938CrossRef

Zdrzałka S (1991) Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. Oper Res Lett 10(9):519–523CrossRef

Titel: A Free-Slack-Based Genetic Algorithm for the Robotic Cell Problem with Controllable Processing Times
verfasst von: Mohammed Al-Salem
Mohamed Haouari
Mohamed Kharbeche
Wael Khallouli
Verlag: Springer International Publishing
Buch: Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
Print ISBN: 978-3-319-26022-8

Electronic ISBN: 978-3-319-26024-2

Copyright-Jahr: 2016
DOI: https://doi.org/10.1007/978-3-319-26024-2_4