An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165)
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 4102806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for single machine sequencing with release dates to minimize maximum cost |
scientific article; zbMATH DE number 4102806 |
Statements
An algorithm for single machine sequencing with release dates to minimize maximum cost (English)
0 references
1989
0 references
single machine
0 references
release dates
0 references
precedence constraints
0 references
general cost functions
0 references
branch-and-bound
0 references
minimizing maximum cost
0 references
block of jobs
0 references
Dominance relations
0 references
lower bounds
0 references
heuristic
0 references
Computational experiments
0 references
0 references
0 references
0.8719986081123352
0 references
0.8389277458190918
0 references
0.8373353481292725
0 references
