Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop (Q3360653)
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: Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop |
scientific article; zbMATH DE number 4213725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop |
scientific article; zbMATH DE number 4213725 |
Statements
Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop (English)
0 references
1991
0 references
polynomial-time algorithm
0 references
known processing times and due dates
0 references
single machine
0 references
bicriteria objective function
0 references
0.8268208503723145
0 references
0.8224685192108154
0 references
0.8140475749969482
0 references
0.8136492371559143
0 references
