On lower bounds on the minimum maximum lateness on one machine subject to release date (Q1096536)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4031383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lower bounds on the minimum maximum lateness on one machine subject to release date |
scientific article; zbMATH DE number 4031383 |
Statements
On lower bounds on the minimum maximum lateness on one machine subject to release date (English)
0 references
1987
0 references
This paper deals with lower bounds for the problem of minimizing maximum lateness on one machine with release dates. The problem may be used to compute bounds for other sequencing problems, such as \(F\| C_{\max}\), \(J\| C_{\max}\), etc. Various lower bounds for the above problem are described and the relations between them are discussed.
0 references
lower bounds
0 references
maximum lateness
0 references
0.8338168859481812
0 references
0.829396665096283
0 references
0.8208897709846497
0 references
0.8134316205978394
0 references
