Archivio Istituzionale della RicercaIn 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; Salassa, Fabio. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 180:(2025). [10.1016/j.cor.2025.107055]
A note on “Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers”
Salassa, Fabio
2025
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 | Dimensione | Formato | |
|---|---|---|---|
|
R2CommonServerNote_COR_2025.pdf
accesso riservato
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Non Pubblico - Accesso privato/ristretto
Dimensione
540.51 kB
Formato
Adobe PDF
|
540.51 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2998747