Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem (Q3939582): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Shrikant S. Panwalkar / rank | |||
| Property / author | |||
| Property / author: Shrikant S. Panwalkar / rank | |||
Normal 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.1287/opre.30.2.391 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117416910 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem |
scientific article |
Statements
Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem (English)
0 references
1982
0 references
common due date assignment
0 references
n job, one machine scheduling
0 references
total penalty function
0 references
polynomial bound scheduling algorithm
0 references
optimality proof
0 references
