Parallel/Distributed Tabu Search for Scheduling Microprocessor Tasks in Hybrid Flowshop
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912586149134336 |
|---|---|
| author | Janiak, Adam Kowalczyk, Damian Lichtenstein, Maciej |
| author_facet | Janiak, Adam Kowalczyk, Damian Lichtenstein, Maciej |
| contents | The paper deals with the makespan minimization in the hybrid flow shop scheduling problem with multiprocessor tasks. The hybrid flow shop (HFS) generalizes the classical flow shop processor configuration by replacing each processor (processing stage) by some number of identical parallel processors. Similarly, the multiprocessor tasks generalize the classical assumption, by allowing a task to require more than one processor simultaneously for its processing. In this work we present the algorithm for solving the problem based on the tabu search technique. The proposed algorithm uses parallel and distributed mechanisms for neighborhood evaluation and well balances heterogeneous network environment. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_11396 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Parallel/Distributed Tabu Search for Scheduling Microprocessor Tasks in Hybrid Flowshop Janiak, Adam Kowalczyk, Damian Lichtenstein, Maciej Distributed, Parallel, and Cluster Computing Systems and Control C.2.4 The paper deals with the makespan minimization in the hybrid flow shop scheduling problem with multiprocessor tasks. The hybrid flow shop (HFS) generalizes the classical flow shop processor configuration by replacing each processor (processing stage) by some number of identical parallel processors. Similarly, the multiprocessor tasks generalize the classical assumption, by allowing a task to require more than one processor simultaneously for its processing. In this work we present the algorithm for solving the problem based on the tabu search technique. The proposed algorithm uses parallel and distributed mechanisms for neighborhood evaluation and well balances heterogeneous network environment. |
| title | Parallel/Distributed Tabu Search for Scheduling Microprocessor Tasks in Hybrid Flowshop |
| topic | Distributed, Parallel, and Cluster Computing Systems and Control C.2.4 |
| url | https://arxiv.org/abs/2509.11396 |