Skip to main navigation Skip to search Skip to main content

Behind the scenes of deadline24: A memetic algorithm for the modified job shop scheduling problem

  • Deadline24
  • Future Processing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Job shop scheduling problem (JSSP) is an NP-hard optimization problem which has been widely studied in the literature due to its practical applicability. In this paper, we show how to model a workflow using a modified version of JSSP, in which a given operation may be executed on a number of different machines. Solving the instances of this modified JSSP, elaborated using our benchmark generation routine, constituted a qualifying task of the Deadline24 programming marathon. In the experimental study, we confront the results submitted by the participants with the solutions obtained using our memetic algorithms and other solvers. This analysis is backed up with the statistical tests.

Original languageEnglish
Title of host publicationMan-Machine Interactions 5 - 5th International Conference on Man-Machine Interactions, ICMMI 2017
EditorsAleksandra Gruca, Tadeusz Czachorski, Katarzyna Harezlak, Stanislaw Kozielski, Agnieszka Piotrowska, Tadeusz Czachorski
PublisherSpringer Verlag
Pages502-512
Number of pages11
ISBN (Print)9783319677910
DOIs
Publication statusPublished - 2018
Event5th International Conference on Man-Machine Interactions, ICMMI 2017 - Krakow, Poland
Duration: 3 Oct 20176 Oct 2017

Publication series

NameAdvances in Intelligent Systems and Computing
Volume659
ISSN (Print)2194-5357

Conference

Conference5th International Conference on Man-Machine Interactions, ICMMI 2017
Country/TerritoryPoland
CityKrakow
Period3/10/176/10/17

Keywords

  • Benchmark generation
  • Job shop sheduling problem
  • Memetic algorithm
  • Workflow modeling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • General Computer Science

Fingerprint

Dive into the research topics of 'Behind the scenes of deadline24: A memetic algorithm for the modified job shop scheduling problem'. Together they form a unique fingerprint.

Cite this