Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time

In this paper, a flow shop scheduling problem with minimal and maximal machine idle time with the goal of minimizing makespan is considered. The mathematical model of the problem is presented. A generalization of the prefix sum, called the job shift scan, for computing required shifts for overlappin...

Celý popis

Podrobná bibliografie

Hlavní autor:	Jarosław Rudy
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	MDPI AG 2021-09-01
Edice:	Applied Sciences
Témata:	flowshop scheduling discrete optimization parallel computing CUDA prefix sums minimal idle time
On-line přístup:	https://www.mdpi.com/2076-3417/11/17/8204
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!