How good is a dense shop schedule? (Q5931907): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3995531 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-case analysis of an approximation algorithm for flow-shop scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3670909 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Short Shop Schedules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4744042 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3496142 / rank | |||
Normal rank |
Latest revision as of 16:50, 3 June 2024
scientific article; zbMATH DE number 1594647
Language | Label | Description | Also known as |
---|---|---|---|
English | How good is a dense shop schedule? |
scientific article; zbMATH DE number 1594647 |
Statements
How good is a dense shop schedule? (English)
0 references
6 May 2001
0 references
worst-case performance
0 references
shop schedules
0 references
dense schedules
0 references
bounds
0 references
maximum deviation
0 references
makespan of dense flow-shop
0 references
job-shop schedules
0 references