Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A genetic algorithm with shuffle for job shop scheduling problems
University West, Department of Engineering Science, Division of Automation Systems. (PTW)ORCID iD: 0000-0002-6604-6904
University West, Department of Engineering Science, Division of Automation Systems. (PTW)ORCID iD: 0000-0002-8878-2718
University West, Department of Engineering Science, Division of Automation Systems.
2015 (English)In: Modelling and simulation 2015: The European simulation and modelling conference 2015, ESM 2015, October 26-28 Leicester, United Kingdom / [ed] Marwan Al-Akaidi & Aladdin Ayesh, Ostend: ESM , 2015, 363-367 p.Conference paper, Published paper (Refereed)
Abstract [en]

Job shop scheduling problems are computationally complex combinatorial optimization problems. Genetic algorithms have been used in various forms and in combination with other algorithms to solve job shop scheduling problems. A partially flexible job shop with precedence constraints increases this complex behaviour. There are two main parts to optimizing ajob shop, the routing and the scheduling. The objective here is to get consistent optimal makespan using a genetic algorithm. This paper firstly, presents a simulation approach for the considered partially flexible job shop scheduling problem. Which take into account the precedence constraints and reduce situations of deadlock. To solve the partially flexible job shop scheduling problem a genetic algorithm was used and improved. It utilise a genetic crossovers for routing and a new random shuffle feature is introduced for the scheduling. The computational results have shown that the algorithm performs well in terms of finding a consistent optimal schedule for the given problem

Place, publisher, year, edition, pages
Ostend: ESM , 2015. 363-367 p.
Keyword [en]
Simulation based optimisation, genetic algorithm, job shop scheduling, random shuffle
National Category
Robotics
Research subject
ENGINEERING, Manufacturing and materials engineering; Production Technology
Identifiers
URN: urn:nbn:se:hv:diva-8622Scopus ID: 2-s2.0-84963615118ISBN: 978-90-77381-90-8 (print)OAI: oai:DiVA.org:hv-8622DiVA: diva2:867712
Conference
The 29th annual European simulation and modelling conference 2015, ESM 2015, October 26-28 Leicester, United Kingdom
Available from: 2015-11-06 Created: 2015-11-06 Last updated: 2016-04-27Bibliographically approved

Open Access in DiVA

No full text

Other links

ScopusKonferenssida

Authority records BETA

Danielsson, FredrikSvensson, Bo

Search in DiVA

By author/editor
Danielsson, FredrikSvensson, BoReddy, Dhanush
By organisation
Division of Automation Systems
Robotics

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 335 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf