An open shop scheduling problem with a non-bottleneck machine (Q1371949): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Vitaly A. Strusevich / rank | |||
| Property / author | |||
| Property / author: Leslie A. Hall / rank | |||
| Property / author | |||
| Property / author: Vitaly A. Strusevich / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Leslie A. Hall / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(97)00030-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979848432 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:58, 30 July 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
