Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times (Q4314863): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times | |||
| 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.1002/1520-6750(199410)41:6<843::aid-nav3220410612>3.0.co;2-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982565913 / rank | |||
Normal rank | |||
| Property / title | |||
Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times (English) | |||
| Property / title: Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:32, 30 July 2024
scientific article; zbMATH DE number 698818
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times |
scientific article; zbMATH DE number 698818 |
Statements
13 December 1995
0 references
due date with tolerance
0 references
mean absolute deviation of job completion times
0 references
unrestricted given common due date
0 references
\(n\)-job single-machine scheduling
0 references
polynomial-time algorithm
0 references
Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times (English)
0 references
