A note on “Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers”

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research Pub Date : 2025-03-16 DOI:10.1016/j.cor.2025.107055

Andrea Grosso , Fabio Salassa

引用次数: 0

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.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Computers & Operations Research 工程技术-工程：工业

CiteScore

8.60

自引率

8.70%

发文量

292

审稿时长

8.5 months

期刊介绍： Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.