We consider the problem of moving production lots within the clean room of LFoundry, an important Italian manufacturer of micro-electronic devices. The problem is modeled as dial-a-ride in a dynamic environment with the objective of makespan minimization. This general objective is achieved by minimizing, at each optimization cycle, the largest completion time among the vehicles, so as to locally balance their workloads. A cluster-first route-second heuristic is devised for on-line use and compared to the actual practice through a computational experience based on real plant data.

A dynamic dial-a-ride model for optimal vehicle routing in a wafer fab

Claudio Arbib;Fatemeh kafash Ranjbar
;
Stefano Smriglio
2021

Abstract

We consider the problem of moving production lots within the clean room of LFoundry, an important Italian manufacturer of micro-electronic devices. The problem is modeled as dial-a-ride in a dynamic environment with the objective of makespan minimization. This general objective is achieved by minimizing, at each optimization cycle, the largest completion time among the vehicles, so as to locally balance their workloads. A cluster-first route-second heuristic is devised for on-line use and compared to the actual practice through a computational experience based on real plant data.
978-989-758-485-5
File in questo prodotto:
File Dimensione Formato  
ICORES_2021_53.pdf

non disponibili

Descrizione: Articolo principale
Tipologia: Documento in Pre-print
Licenza: Creative commons
Dimensione 427.38 kB
Formato Adobe PDF
427.38 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.

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