An open shop scheduling problem with a non-bottleneck machine (Q1371949): 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: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3995531 / rank | |||
Normal rank | |||
Revision as of 19:54, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An open shop scheduling problem with a non-bottleneck machine |
scientific article |
Statements
An open shop scheduling problem with a non-bottleneck machine (English)
0 references
6 November 1997
0 references
fully polynomial approximation scheme
0 references
worst-case analysis
0 references
approximation
0 references
two-machine non-preemptive open shop
0 references
makespan
0 references
maximum completion time
0 references
