The Joint Workload, Workstation and Buffer Allocation Problem (JWWBAP) of open flow lines has been recently investigated in the context of manufacturing system design. This work proposes a simulation cutting approach to exactly and efficiently solve the JWWBAP based on a single sample path. Specifically, a sample path based simula- tion optimization model of the JWWBAP is formulated into a Mathematical Programming Representation (MPR). The MPR is a large mixed integer programming model with high complexity, and a method to approximately solve it has been the subject of our previous research. In this paper, its exact solution is addressed and to this purpose, the Benders decomposition is adopted. The subproblem of the Benders decomposition is an MRP of the simulation aspect of the overall problem and its dual is a network flow problem. We show that both the subproblem and the dual subproblem can be solved using the simulation trajectory. From the solution of the subproblem, a cut is gener- ated and added to the master problem of the Benders decomposition, which corresponds to the optimization aspect of the overall problem. Numerical experiments are conducted to analyze the JWWBAP and the performance of the proposed approach.

Simulation Cutting Approach: Joint Workstation, Workload and Buffer Allocation Problem

Zhang M.;Matta A.;Alfieri A.;Pedrielli G.
2017

Abstract

The Joint Workload, Workstation and Buffer Allocation Problem (JWWBAP) of open flow lines has been recently investigated in the context of manufacturing system design. This work proposes a simulation cutting approach to exactly and efficiently solve the JWWBAP based on a single sample path. Specifically, a sample path based simula- tion optimization model of the JWWBAP is formulated into a Mathematical Programming Representation (MPR). The MPR is a large mixed integer programming model with high complexity, and a method to approximately solve it has been the subject of our previous research. In this paper, its exact solution is addressed and to this purpose, the Benders decomposition is adopted. The subproblem of the Benders decomposition is an MRP of the simulation aspect of the overall problem and its dual is a network flow problem. We show that both the subproblem and the dual subproblem can be solved using the simulation trajectory. From the solution of the subproblem, a cut is gener- ated and added to the master problem of the Benders decomposition, which corresponds to the optimization aspect of the overall problem. Numerical experiments are conducted to analyze the JWWBAP and the performance of the proposed approach.
Proceedings of the 11th Conference on Stochastic Models of Manufacturing and Service Operations
978-889-4128-62-8
mathematical programming, manufacturing system, decomposition, buffer allocation problem
File in questo prodotto:
File Dimensione Formato  
Simulation Cutting Approach Joint Workstation Workload and Buffer Allocation Problem.pdf

Accesso riservato

: Publisher’s version
Dimensione 488.16 kB
Formato Adobe PDF
488.16 kB 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: http://hdl.handle.net/11311/1053039
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact