Fast solution of single-machine scheduling problem with embedded jobs (Q2420645)
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 7063548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast solution of single-machine scheduling problem with embedded jobs |
scientific article; zbMATH DE number 7063548 |
Statements
Fast solution of single-machine scheduling problem with embedded jobs (English)
0 references
6 June 2019
0 references
polynomial-time algorithm
0 references
single-machine scheduling
0 references
release time
0 references
due date
0 references
lateness
0 references
time complexity
0 references
0.8345323204994202
0 references
0.8157730102539062
0 references
0.7993496656417847
0 references
0.7953728437423706
0 references
0.7912113666534424
0 references
