A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint (Q5436474): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.20189 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2141603040 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithm Theory - SWAT 2004 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:25, 27 June 2024
scientific article; zbMATH DE number 5227433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint |
scientific article; zbMATH DE number 5227433 |
Statements
A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint (English)
0 references
16 January 2008
0 references
modeling
0 references
machine scheduling
0 references
crane
0 references
approximation
0 references
heuristics
0 references
search
0 references
