One-machine generalized precedence constrained scheduling problems (Q1342279): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: One-machine generalized precedence constrained scheduling problems / rank | |||
Normal rank | |||
Latest revision as of 10:22, 23 May 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
0 references
