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 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1057/jors.1991.31 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1057/JORS.1991.31 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:43, 21 December 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
