Search Results - Parallel greedy algorithms
-
1
Parallel Greedy Algorithms for Steiner Forest
ISSN: 1045-9219, 1558-2183Published: IEEE 01.06.2025Published in 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…”
Get full text
Journal Article -
2
Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach
ISSN: 1568-4946, 1872-9681Published: Elsevier B.V 01.09.2010Published in Applied soft computing (01.09.2010)“… In this study we present an effective parallel greedy algorithm to solve HFSMT problem. Parallel greedy algorithm (PGA…”
Get full 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-0634Published: Hoboken Wiley Subscription Services, Inc 25.06.2021Published in Concurrency and computation (25.06.2021)“… In addition, to shorten the computation time, we show the parallel algorithm and its GPU acceleration technique…”
Get full text
Journal Article -
4
Iterated greedy algorithms for a complex parallel machine scheduling problem
ISSN: 0377-2217, 1872-6860Published: Elsevier B.V 16.07.2022Published in European journal of operational research (16.07.2022)“…•Development of Iterated Greedy algorithms to solve a complex scheduling problem…”
Get full 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-3453Published: Ayandegan Institute of Higher Education 01.07.2022Published in 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…”
Get full 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-6793Published: New York Elsevier Ltd 01.12.2021Published in Expert systems with applications (01.12.2021)“… The performance analysis of several iterated greedy algorithms with different…”
Get full text
Journal Article -
7
Parallel Simulated Annealing with a Greedy Algorithm for Bayesian Network Structure Learning
ISSN: 1041-4347, 1558-2191Published: New York IEEE 01.06.2020Published in IEEE transactions on knowledge and data engineering (01.06.2020)“…We present a hybrid algorithm called parallel simulated annealing with a greedy algorithm (PSAGA…”
Get full text
Journal Article -
8
Parallel Greedy Search for Random Access in Wireless Networks
ISSN: 0256-4602, 0974-5971Published: Taylor & Francis 04.07.2023Published in 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…”
Get full text
Journal Article -
9
Pore Networks Simulation with Parallel Greedy Algorithms
ISBN: 9781467329545, 1467329541ISSN: 1550-6525Published: IEEE 01.10.2012Published in 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…”
Get full text
Conference Proceeding -
10
Multi-neighborhood Parallel Greedy Search Algorithm for Human-robot Collaborative Multi-product Hybrid Disassembly Line Balancing Problem
ISSN: 2577-1655Published: IEEE 09.10.2022Published in 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…”
Get full text
Conference Proceeding -
11
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
ISSN: 1435-246X, 1613-9178Published: Berlin/Heidelberg Springer-Verlag 01.12.2009Published in 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…”
Get full 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-8352Published: Elsevier Ltd 01.03.2017Published in 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…”
Get full text
Journal Article -
13
Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm
ISSN: 0020-7543, 1366-588XPublished: London Taylor & Francis 16.02.2016Published in 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…”
Get full text
Journal Article -
14
An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem
ISSN: 0957-4174, 1873-6793Published: New York Elsevier Ltd 01.05.2019Published in Expert systems with applications (01.05.2019)“…•An iterated greedy algorithm for the total tardiness parallel blocking flow shop problem…”
Get full text
Journal Article Publication -
15
A Family of Fast Parallel Greedy Algorithms for the Steiner Forest Problem
ISBN: 9781665497480Published: IEEE 01.05.2022Published in 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…”
Get full text
Conference Proceeding -
16
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem
ISSN: 1862-4472, 1862-4480Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2024Published in Optimization letters (01.01.2024)“… A mixed integer programming model and a parallel greedy algorithm proposed in an earlier…”
Get full 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-4281Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022Published in 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…”
Get full text
Journal Article -
18
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
ISSN: 0305-0548, 1873-765X, 0305-0548Published: Kidlington Elsevier Ltd 01.07.2013Published in 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…”
Get full text
Journal Article -
19
Parallel implementation of the greedy heuristic clustering algorithms
ISSN: 1757-8981, 1757-899XPublished: Bristol IOP Publishing 01.05.2019Published in 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…”
Get full 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-6769Published: Elsevier Ltd 01.01.2019Published in 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…”
Get full text
Journal Article

