Código QR (código de barras bidimensional)

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...

Fuld beskrivelse

Na minha lista:
Hovedforfatter: Jarosław Rudy
Format: Artigo
Sprog:Inglês
Udgivet: MDPI AG 2021-09-01
Serier:Applied Sciences
Fag:
flowshop scheduling
discrete optimization
parallel computing
CUDA
prefix sums
minimal idle time
Online adgang:https://www.mdpi.com/2076-3417/11/17/8204
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker