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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2021-09-01
|
| Serie: | Applied Sciences |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/2076-3417/11/17/8204 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|