REAL

Comparison of cooling strategies in simulated annealing algorithms for flow-shop scheduling

Miliczki, József and Fazekas, Levente (2022) Comparison of cooling strategies in simulated annealing algorithms for flow-shop scheduling. PRODUCTION SYSTEMS AND INFORMATION ENGINEERING, 10 (3). pp. 129-136. ISSN 1785-1270

[img]
Preview
Text
2058-Article Text-9033-1-10-20230619.pdf - Published Version

Download (460kB) | Preview

Abstract

Flow-shop scheduling is considered. The order of operations must be the same for each job to minimize the maximum completion time. The Simulated Annealing algorithm is a standard approximate solution method in scheduling and optimization in general. Since the algorithm depends on cooling as a heuristic to generate better approx- imations, choosing the strategy with which the temperature decreases can affect the final result.

Item Type: Article
Uncontrolled Keywords: flow-shop, scheduling, heuristics, simulated annealing, annealing strategies
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Q Science / természettudomány > QA Mathematics / matematika > QA76 Computer software / programozás
Depositing User: Anita Agárdi
Date Deposited: 26 Nov 2024 14:12
Last Modified: 26 Nov 2024 14:12
URI: https://real.mtak.hu/id/eprint/210301

Actions (login required)

Edit Item Edit Item