Complexity of the job insertion problem in multi-stage scheduling (Q2467449): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound for the job insertion problem. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Job Shop Scheduling by Local Search / rank | |||
Normal rank |
Revision as of 14:38, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of the job insertion problem in multi-stage scheduling |
scientific article |
Statements
Complexity of the job insertion problem in multi-stage scheduling (English)
0 references
21 January 2008
0 references
scheduling
0 references
computational complexity
0 references