REAL

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

Fazekas, Levente and Kulcsár, Gyula (2022) Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints. PRODUCTION SYSTEMS AND INFORMATION ENGINEERING, 10 (1). pp. 30-48. ISSN 1785-1270

[img]
Preview
Text
1825-Article Text-7188-2-10-20220712.pdf

Download (469kB) | Preview

Abstract

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.

Item Type: Article
Uncontrolled Keywords: Flow-shop, Constrained Flow-shop, Resource constraints, Scheduling, Optimization, Working hours, Transfer times, Setup times, Makespan
Subjects: T Technology / alkalmazott, műszaki tudományok > T2 Technology (General) / műszaki tudományok általában
Depositing User: Anita Agárdi
Date Deposited: 05 Sep 2022 07:25
Last Modified: 03 Apr 2023 07:57
URI: https://real.mtak.hu/id/eprint/147641

Actions (login required)

Edit Item Edit Item