One-machine generalized precedence constrained scheduling problems (Q1342279)
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 710265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-machine generalized precedence constrained scheduling problems |
scientific article; zbMATH DE number 710265 |
Statements
One-machine generalized precedence constrained scheduling problems (English)
0 references
11 January 1995
0 references
The authors investigate one-machine scheduling problems subject to generalized precedence constraints. These constraints specify that for the time between the end of some job and the beginning of another job nonnegative lower and upper bounds are given. The objective is to minimize makespan. For some special cases of the introduced precedence relations complexity investigations are carried out.
0 references
heuristics
0 references
one-machine scheduling
0 references
generalized precedence constraints
0 references
makespan
0 references
0 references
0.8343911170959473
0 references
0.8203790783882141
0 references
