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

詳細記述

書誌詳細

出版年:	Applied Sciences
第一著者:	Jarosław Rudy
フォーマット:	論文
言語:	英語
出版事項:	MDPI AG 2021-09-01
主題:	flowshop scheduling discrete optimization parallel computing CUDA prefix sums minimal idle time
オンライン･アクセス:	https://www.mdpi.com/2076-3417/11/17/8204