Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop (Q3360653): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/jors.1991.83 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2119754524 / rank | |||
Normal rank | |||
Revision as of 21:58, 19 March 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
