A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes (Q1590036): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multi-resource shop scheduling with resource flexibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Job Shop Scheduling by Simulated Annealing / rank | |||
Normal rank | |||
Latest revision as of 10:19, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes |
scientific article |
Statements
A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes (English)
0 references
19 December 2000
0 references
acyclic directed graphs
0 references
polynomial time complexity
0 references
on-line scheduling
0 references
local search
0 references
