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

Full description

Bibliographic Details
Published in:Applied Sciences
Main Author: Jarosław Rudy
Format: Article
Language:English
Published: MDPI AG 2021-09-01
Subjects:
flowshop scheduling
discrete optimization
parallel computing
CUDA
prefix sums
minimal idle time
Online Access:https://www.mdpi.com/2076-3417/11/17/8204

Internet

https://www.mdpi.com/2076-3417/11/17/8204

Similar Items