Minimizing late jobs in the general one machine scheduling problem (Q1130035): 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/0377-2217(94)00116-t / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086491340 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing late jobs in the general one machine scheduling problem |
scientific article |
Statements
Minimizing late jobs in the general one machine scheduling problem (English)
0 references
16 August 1998
0 references
minimizing the number of late jobs
0 references
one machine
0 references
release dates
0 references
different due dates
0 references
lower bound
0 references
heuristic
0 references
0 references
0 references
