Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637)
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: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints |
scientific article; zbMATH DE number 6635661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints |
scientific article; zbMATH DE number 6635661 |
Statements
Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (English)
0 references
7 October 2016
0 references
single-machine scheduling
0 references
family scheduling
0 references
tardiness minimisation
0 references
resource constraints
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8789806962013245
0 references
0.8735342025756836
0 references
0.8713314533233643
0 references
0.8375633358955383
0 references
