Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop (Q3360653): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:13, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop |
scientific article |
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
