Výsledky vyhledávání - Parallel greedy algorithms
-
1
Parallel Greedy Algorithms for Steiner Forest
ISSN: 1045-9219, 1558-2183Vydáno: IEEE 01.06.2025Vydáno v IEEE transactions on parallel and distributed systems (01.06.2025)“… of the terminal pairs together. We design a family of parallel greedy algorithms based on a sequential heuristic greedy algorithm called Paired Greedy, which iteratively connects the terminal pairs that have the minimum distance…”
Získat plný text
Journal Article -
2
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach
ISSN: 1568-4946, 1872-9681Vydáno: Elsevier B.V 01.09.2010Vydáno v Applied soft computing (01.09.2010)“… In this study we present an effective parallel greedy algorithm to solve HFSMT problem. Parallel greedy algorithm (PGA…”
Získat plný text
Journal Article -
3
Tile art image generation using parallel greedy algorithm on the GPU and its approximation with machine learning
ISSN: 1532-0626, 1532-0634Vydáno: Hoboken Wiley Subscription Services, Inc 25.06.2021Vydáno v Concurrency and computation (25.06.2021)“… In addition, to shorten the computation time, we show the parallel algorithm and its GPU acceleration technique…”
Získat plný text
Journal Article -
4
Iterated greedy algorithms for a complex parallel machine scheduling problem
ISSN: 0377-2217, 1872-6860Vydáno: Elsevier B.V 16.07.2022Vydáno v European journal of operational research (16.07.2022)“…•Development of Iterated Greedy algorithms to solve a complex scheduling problem…”
Získat plný text
Journal Article -
5
An efficient parallel greedy algorithm for fuzzy hybrid flow shop scheduling with setup time and lot size: a case study in apparel process
ISSN: 2783-1442, 2717-3453Vydáno: Ayandegan Institute of Higher Education 01.07.2022Vydáno v Journal of fuzzy extension & applications (Online) (01.07.2022)“…This paper deals with the Fuzzy Hybrid Flow Shop (FHFS) scheduling inspired by a real apparel process. A Parallel Greedy (PG…”
Získat plný text
Journal Article -
6
An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times
ISSN: 0957-4174, 1873-6793Vydáno: New York Elsevier Ltd 01.12.2021Vydáno v Expert systems with applications (01.12.2021)“… The performance analysis of several iterated greedy algorithms with different…”
Získat plný text
Journal Article -
7
Parallel Simulated Annealing with a Greedy Algorithm for Bayesian Network Structure Learning
ISSN: 1041-4347, 1558-2191Vydáno: New York IEEE 01.06.2020Vydáno v IEEE transactions on knowledge and data engineering (01.06.2020)“…We present a hybrid algorithm called parallel simulated annealing with a greedy algorithm (PSAGA…”
Získat plný text
Journal Article -
8
Parallel Greedy Search for Random Access in Wireless Networks
ISSN: 0256-4602, 0974-5971Vydáno: Taylor & Francis 04.07.2023Vydáno v Technical review - IETE (04.07.2023)“… In this paper, we use multiple measurement vector model for the received signal and develop a parallel greedy search algorithm and it's stopping criteria to detect the active users…”
Získat plný text
Journal Article -
9
Pore Networks Simulation with Parallel Greedy Algorithms
ISBN: 9781467329545, 1467329541ISSN: 1550-6525Vydáno: IEEE 01.10.2012Vydáno v 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications (01.10.2012)“… The No MISS greedy algorithm outstands from the existing sequential algorithms for constructing a pore sub network, in a relatively fast way…”
Získat plný text
Konferenční příspěvek -
10
Multi-neighborhood Parallel Greedy Search Algorithm for Human-robot Collaborative Multi-product Hybrid Disassembly Line Balancing Problem
ISSN: 2577-1655Vydáno: IEEE 09.10.2022Vydáno v Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics (09.10.2022)“… A hybrid line combines a single-row line and a U-shaped line. We use the multi-neighborhood parallel greedy search algorithm to solve the model…”
Získat plný text
Konferenční příspěvek -
11
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
ISSN: 1435-246X, 1613-9178Vydáno: Berlin/Heidelberg Springer-Verlag 01.12.2009Vydáno v Central European journal of operations research (01.12.2009)“…). Furthermore, the new greedy algorithms were parallelized using a master slave approach. The resulting parallel methods were tested using the instances introduced by Stoyan and Yaskov (Eur J Oper Res 156:590–600, 2004…”
Získat plný text
Journal Article -
12
An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times
ISSN: 0360-8352Vydáno: Elsevier Ltd 01.03.2017Vydáno v Computers & industrial engineering (01.03.2017)“…•We propose an iterated greedy algorithm to solve the problem.•We compare our algorithm with three meta-heuristics in the literature…”
Získat plný text
Journal Article -
13
Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm
ISSN: 0020-7543, 1366-588XVydáno: London Taylor & Francis 16.02.2016Vydáno v International journal of production research (16.02.2016)“…This work proposes a high-performance algorithm for solving the multi-objective unrelated parallel machine scheduling problem…”
Získat plný text
Journal Article -
14
An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
ISSN: 0957-4174, 1873-6793Vydáno: New York Elsevier Ltd 01.05.2019Vydáno v Expert systems with applications (01.05.2019)“…•An iterated greedy algorithm for the total tardiness parallel blocking flow shop problem…”
Získat plný text
Journal Article Publikace -
15
A Family of Fast Parallel Greedy Algorithms for the Steiner Forest Problem
ISBN: 9781665497480Vydáno: IEEE 01.05.2022Vydáno v 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (01.05.2022)“…We introduce a family of fast parallel greedy algorithms for the Steiner Forest Problem, a fundamental combinatorial optimization problem in graphs…”
Získat plný text
Konferenční příspěvek -
16
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem
ISSN: 1862-4472, 1862-4480Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2024Vydáno v Optimization letters (01.01.2024)“… A mixed integer programming model and a parallel greedy algorithm proposed in an earlier…”
Získat plný text
Journal Article -
17
Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows
ISSN: 2193-567X, 1319-8025, 2191-4281Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022Vydáno v Arabian journal for science and engineering (2011) (01.03.2022)“…In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows…”
Získat plný text
Journal Article -
18
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
ISSN: 0305-0548, 1873-765X, 0305-0548Vydáno: Kidlington Elsevier Ltd 01.07.2013Vydáno v Computers & operations research (01.07.2013)“…In this work, we tackle the problem of scheduling a set of jobs on a set of unrelated parallel machines with minimising the total weighted completion times as performance criteria…”
Získat plný text
Journal Article -
19
Parallel implementation of the greedy heuristic clustering algorithms
ISSN: 1757-8981, 1757-899XVydáno: Bristol IOP Publishing 01.05.2019Vydáno v IOP conference series. Materials Science and Engineering (01.05.2019)“…Authors propose parallel greedy heuristic k-means clustering algorithms for implementation on the graphical processing units (GPU…”
Získat plný text
Journal Article -
20
An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times
ISSN: 0952-1976, 1873-6769Vydáno: Elsevier Ltd 01.01.2019Vydáno v Engineering applications of artificial intelligence (01.01.2019)“…This paper investigates the problem of scheduling a set of jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch machines with different capacities so as to…”
Získat plný text
Journal Article

