Fast approximation algorithm for job sequencing with deadlines (Q1154384): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4090116 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3050129 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3888846 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for Scheduling Independent Tasks / rank | |||
Normal rank |
Revision as of 11:43, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast approximation algorithm for job sequencing with deadlines |
scientific article |
Statements
Fast approximation algorithm for job sequencing with deadlines (English)
0 references
1981
0 references
fast approximation algorithm
0 references
job sequencing
0 references
deadlines
0 references
range-and-bound method
0 references
minimization of delay penalties
0 references
polynomial epsilon-approximation algorithm
0 references
0 references