Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00438-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067913114 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using short-term memory to minimize the weighted number of late jobs on a single machine. |
scientific article |
Statements
Using short-term memory to minimize the weighted number of late jobs on a single machine. (English)
0 references
18 June 2003
0 references
Scheduling
0 references
Weighted number of late jobs
0 references
Release times
0 references
Branch-and-bound
0 references
Dynamic programming
0 references
Lagrangean relaxation
0 references
Time-indexed formulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
