In a recent paper a two-machines two-servers scheduling problem with identical machines but unrelated servers and makespan objective is studied and solved via sophisticated Variable-Neighbourhood Search procedures, for instances up to 120 jobs in size. We show that the same problem can be transformed to a pretty standard problem with unrelated machines that can be efficiently solved to optimality, up to much larger instances.
A note on “Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers”
Grosso, Andrea
First
;
2025-01-01
Abstract
In a recent paper a two-machines two-servers scheduling problem with identical machines but unrelated servers and makespan objective is studied and solved via sophisticated Variable-Neighbourhood Search procedures, for instances up to 120 jobs in size. We show that the same problem can be transformed to a pretty standard problem with unrelated machines that can be efficiently solved to optimality, up to much larger instances.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
R2CmaxUnrelatedServers.pdf
Accesso aperto
Tipo di file:
PREPRINT (PRIMA BOZZA)
Dimensione
214.09 kB
Formato
Adobe PDF
|
214.09 kB | Adobe PDF | Visualizza/Apri |
|
1-s2.0-S0305054825000838-main.pdf
Accesso aperto con embargo fino al 23/04/2028
Tipo di file:
PDF EDITORIALE
Dimensione
560.16 kB
Formato
Adobe PDF
|
560.16 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
