Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / 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: Short Shop Schedules / 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: An Algorithm for the Open-Shop Problem / rank | |||
Normal rank | |||
Latest revision as of 19:25, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan minimization in open shops: A polynomial time approximation scheme |
scientific article |
Statements
Makespan minimization in open shops: A polynomial time approximation scheme (English)
0 references
3 June 1999
0 references
worst-case analysis
0 references
polynomial time approximation scheme
0 references
makespan minimization
0 references
open shop scheduling
0 references
