One-machine generalized precedence constrained scheduling problems (Q1342279): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:01, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-machine generalized precedence constrained scheduling problems |
scientific article |
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
