Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (Q5879664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7658673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints |
scientific article; zbMATH DE number 7658673 |
Statements
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (English)
0 references
2 March 2023
0 references
parallel machines
0 references
availability constraints
0 references
makespan
0 references
scheduling
0 references
semi-resumable jobs
0 references
non-resumable jobs
0 references
0 references
0 references
0.8771680593490601
0 references
0.8305017352104187
0 references
0.8197528123855591
0 references
