Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q596448 |
Changed an Item |
||
| Property / author | |||
| Property / author: Laurent Peridy / rank | |||
Normal rank | |||
Revision as of 18:51, 19 February 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
