A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1319815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for the two-machine open-shop scheduling problem with transportation times |
scientific article; zbMATH DE number 1319815 |
Statements
A heuristic for the two-machine open-shop scheduling problem with transportation times (English)
0 references
7 August 2000
0 references
open shop
0 references
transportation time
0 references
approximation
0 references
worst-case analysis
0 references
0 references
0.9589494466781616
0 references
0.8405441641807556
0 references
0.8390181660652161
0 references
