Firms often need to drastically improve the production rate to meet customer demand, also according to some forecast scenarios. To this end, in the design phase, one of the most significant problem is how to allocate new resources to design efficient production systems. This paper addresses the resource (or server) allocation problem of series-parallel production lines where non-identical machines can be assigned at each stage. Machines can be chosen from a list of versions available on the market, whose purchase cost depends on their related processing speed. The decision problem consists in selecting both number and version of machines to be allocated at each production stage. The goal is to minimize the total cost while assuring a minimum target throughput. To solve the aforementioned server allocation problem (SAP), we accomplished three major research steps. First, we devised an efficient evaluative simulation algorithm that, properly combined with a pattern-based problem representation, allows handling non-identical machines at each stage during the optimization phase. Secondly, we developed a specific constructive heuristic for generating a feasible solution of the SAP. Finally, we used such heuristic solution to speed up the convergence of a new Variable Neighborhood Search (VNS) algorithm, whose effectiveness has been tested through a comprehensive numerical analysis involving five alternative state-of-the-art meta-heuristics.

The Server Allocation Problem with non-identical machines: A meta-heuristic approach

Frigerio N.
2021-01-01

Abstract

Firms often need to drastically improve the production rate to meet customer demand, also according to some forecast scenarios. To this end, in the design phase, one of the most significant problem is how to allocate new resources to design efficient production systems. This paper addresses the resource (or server) allocation problem of series-parallel production lines where non-identical machines can be assigned at each stage. Machines can be chosen from a list of versions available on the market, whose purchase cost depends on their related processing speed. The decision problem consists in selecting both number and version of machines to be allocated at each production stage. The goal is to minimize the total cost while assuring a minimum target throughput. To solve the aforementioned server allocation problem (SAP), we accomplished three major research steps. First, we devised an efficient evaluative simulation algorithm that, properly combined with a pattern-based problem representation, allows handling non-identical machines at each stage during the optimization phase. Secondly, we developed a specific constructive heuristic for generating a feasible solution of the SAP. Finally, we used such heuristic solution to speed up the convergence of a new Variable Neighborhood Search (VNS) algorithm, whose effectiveness has been tested through a comprehensive numerical analysis involving five alternative state-of-the-art meta-heuristics.
2021
Design
Non-identical machines
Optimization
Production system
Server Allocation Problem
File in questo prodotto:
File Dimensione Formato  
The Server Allocation Problem with non-identical machines A meta-heuristic approach.pdf

Accesso riservato

: Publisher’s version
Dimensione 3.11 MB
Formato Adobe PDF
3.11 MB Adobe PDF   Visualizza/Apri
0The Server Allocation Problem with non-identical machines A meta-heuristic approach.pdf

Open Access dal 19/09/2024

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 2.07 MB
Formato Adobe PDF
2.07 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1186875
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 1
social impact