Job release scheduling problem: complexity and an approximation algorithm (Q1946231)
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 6155474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Job release scheduling problem: complexity and an approximation algorithm |
scientific article; zbMATH DE number 6155474 |
Statements
Job release scheduling problem: complexity and an approximation algorithm (English)
0 references
18 April 2013
0 references
scheduling
0 references
variability
0 references
computational complexity
0 references
approximation algorithm
0 references
0.9069509
0 references
0.9036515
0 references
0.8981595
0 references
0 references
0.8954536
0 references
0.88682926
0 references
0.88428605
0 references
0.8823467
0 references
