Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness |
scientific article; zbMATH DE number 6487382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness |
scientific article; zbMATH DE number 6487382 |
Statements
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (English)
0 references
30 September 2015
0 references
scheduling
0 references
maximum lateness
0 references
parallel machines
0 references
integer preemptions
0 references
precedence constraints
0 references
0 references
0 references
0.8638392090797424
0 references
0.8535072207450867
0 references
0.8303893208503723
0 references
0.8204730153083801
0 references
