Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997): Difference between revisions

Latest revision as of 23:27, 30 July 2024

scientific article; zbMATH DE number 7625886

Language	Label	Description	Also known as
English	Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers	scientific article; zbMATH DE number 7625886

Statements

instance of

scholarly article

0 references

title

Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (English)

0 references

author

Jan Gmys

0 references

published in

INFORMS Journal on Computing

0 references

publication date

1 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2012.09511

0 references

zbMATH Keywords

permutation flow-shop scheduling

0 references

branch-and-bound

0 references

supercomputing

0 references

GPU computing

0 references

describes a project that uses

DOGS-PFSP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Solving large quadratic assignment problems on computational grids

0 references

Towards a heterogeneous and adaptive parallel branch-and-bound algorithm

0 references

Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters

0 references

An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

Parallel Branch-and-Branch Algorithms: Survey and Synthesis

0 references

A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem

0 references

On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness

0 references

Parallel Search Algorithms for Discrete Optimization Problems

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion

0 references

Q4398780

0 references

A General Bounding Scheme for the Permutation Flow-Shop Problem

0 references

Iterative beam search algorithms for the permutation flowshop

0 references

A fast tabu search algorithm for the permutation flow-shop problem

0 references

An adaptive branching rule for the permutation flow-shop problem

0 references

Branch-and-bound and parallel computation: A historical note

0 references

Parallel depth first search. I: Implementation

0 references

Parallel hybrid heuristics for the permutation flow shop problem

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

Benchmarks for basic scheduling problems

0 references

New hard benchmark for flowshop scheduling problems minimising makespan

0 references

Identifiers

zbMATH Open document ID

1502.90074

0 references

DOI

10.1287/ijoc.2022.1193

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5057997

@@ Property / OpenAlex ID @@
+W4224277325
@@ Property / OpenAlex ID: W4224277325 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09511
@@ Property / arXiv ID: 2012.09511 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving large quadratic assignment problems on computational grids
+Normal rank
@@ Property / cites work @@
+Towards a heterogeneous and adaptive parallel branch-and-bound algorithm
+Normal rank
@@ Property / cites work @@
+Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
+Normal rank
@@ Property / cites work @@
+An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Branch-and-Branch Algorithms: Survey and Synthesis
+Normal rank
@@ Property / cites work @@
+A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Parallel Search Algorithms for Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+Iterative beam search algorithms for the permutation flowshop
+Normal rank
@@ Property / cites work @@
+A fast tabu search algorithm for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+An adaptive branching rule for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+Branch-and-bound and parallel computation: A historical note
+Normal rank
@@ Property / cites work @@
+Parallel depth first search. I: Implementation
@@ Property / cites work: Parallel depth first search. I: Implementation / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel hybrid heuristics for the permutation flow shop problem
+Normal rank
@@ Property / cites work @@
+A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+New hard benchmark for flowshop scheduling problems minimising makespan
+Normal rank