A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(94)90053-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049418901 / rank | |||
Normal rank | |||
Revision as of 03:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective |
scientific article |
Statements
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (English)
0 references
25 October 1994
0 references
heuristic
0 references
identical parallel machines
0 references
makespan
0 references
near-optimal solutions
0 references
