A two-agent single-machine scheduling problem with late work criteria (Q1701708)
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: A two-agent single-machine scheduling problem with late work criteria |
scientific article; zbMATH DE number 6843950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-agent single-machine scheduling problem with late work criteria |
scientific article; zbMATH DE number 6843950 |
Statements
A two-agent single-machine scheduling problem with late work criteria (English)
0 references
27 February 2018
0 references
scheduling
0 references
two agents
0 references
dynamic programming
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9568037
0 references
0.91673297
0 references
0.91641754
0 references
0.91373223
0 references
0.9109421
0 references
