Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.20122 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041878423 / 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: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
Latest revision as of 14:08, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints |
scientific article |
Statements
Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (English)
0 references
20 February 2007
0 references
open shop
0 references
machine availability
0 references
approximation scheme
0 references
