A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00115-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987867541 / rank | |||
Normal rank | |||
Latest revision as of 10:27, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the two-machine open-shop scheduling problem with transportation times |
scientific article |
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
