No label defined (Q3220064)
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 3887412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3887412 |
Statements
1984
0 references
renewable and nonrenewable resources
0 references
multicriteria linear programming
0 references
multicriteria resource constrained project scheduling
0 references
interactive procedures
0 references
compromise schedules
0 references
0.8430685997009277
0 references
0.8401343822479248
0 references
[For the entire collection see Zbl 0547.00057.] The considered class of multicriteria resource constrained project scheduling problems is defined as follows: Resources are classified into three categories, with respect to the character of the resource constraints: renewable (e.g. machines, manpower, fuel flow), nonrenewable (e.g. money, raw materials, fuel) and doubly-constrained (e.g. energy, investment funds). Each job to be scheduled is characterized by a set of alternative performing modes differing from each other by the quantity and/or quality of resources and by performing time. Jobs are or are not splittable, which corresponds to the preemptive or nonpreemptive case respectively. The time and cost criteria making up the set of scheduling criteria are in general conflicting. The paper presents the formulation of these problems in terms of multicriteria linear programming (0-1 in the nonpreemptive case) and shows interactive procedures for finding best compromise schedules.
0 references