Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557)
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 5318755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan |
scientific article; zbMATH DE number 5318755 |
Statements
Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (English)
0 references
1 September 2008
0 references
scheduling
0 references
parallel machine
0 references
makespan
0 references
almost periodic bin-packing problem
0 references
0.8867810964584351
0 references
0.8673691749572754
0 references
0.837104320526123
0 references
0.833532452583313
0 references
0.8249238133430481
0 references
