Scheduling subject to nonrenewable-resource constraints (Q1169397): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6377(82)90045-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054486362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiobjective network scheduling with efficient use of renewable and nonrenewable resources / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:54, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling subject to nonrenewable-resource constraints |
scientific article |
Statements
Scheduling subject to nonrenewable-resource constraints (English)
0 references
1982
0 references
nonrenewable-resource constraints
0 references
polynomial time algorithm
0 references
precedence constrained scheduling
0 references
minimization of maximum cost
0 references
depletion time dependant job cost
0 references
minimal makespan
0 references