EUVIMEDEUVIMED entdecken
Crossref

Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints

Levente Fazekas, Gyula Kulcsár

Production Systems and Information Engineering · 2022

DOI: 10.32968/psaie.2022.1.3. ↗

Kurz gefasst

Fachartikel in der Zeitschrift Production Systems and Information Engineering, 2022. Verfasst von Levente Fazekas und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Flow-shop scheduling problems are classic examples of multi-resource and multi-operation optimization problems. This paper demonstrates our model and simulation for solving Flow-shop scheduling optimization problems with resource availability constraints to minimize makespan. Working hours, transfer times and setup times are taken into account. Working hours could be interpreted in two ways. In the first option, operations must fit into a single available time slot. In the second option, the simulation could cut operations across multiple time slots. We propose a simulation algorithm that accounts for both scenarios and could be used with any permutation-based exact, heuristic, or search algorithm.

Zitieren

APA

Fazekas, L., & Kulcsár, G. (2022). Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints. Production Systems and Information Engineering. https://doi.org/10.32968/psaie.2022.1.3.

Vancouver

Fazekas L, Kulcsár G. Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints. Production Systems and Information Engineering. 2022. doi:10.32968/psaie.2022.1.3.

BibTeX
@article{Fazekas2022,
  author = {Fazekas, Levente and Kulcsár, Gyula},
  title = {Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints},
  journal = {Production Systems and Information Engineering},
  year = {2022},
  doi = {10.32968/psaie.2022.1.3.}
}
Kostenlos starten →