Discrete Event Optimization: Workstation and buffer allocation problem in manufacturing flow lines

2016 ◽  
Author(s):  
Mengyi Zhang ◽  
Andrea Matta ◽  
Giulia Pedrielli
Keyword(s):  
Discrete Event ◽  
Allocation Problem ◽  
Buffer Allocation ◽  
Flow Lines ◽  
Manufacturing Flow Lines

The state of the art on buffer allocation problem: a comprehensive survey

2012 ◽  
Vol 25 (3) ◽  
pp. 371-392 ◽  
Author(s):  
Leyla Demir ◽  
Semra Tunali ◽  
Deniz Tursel Eliiyi
Keyword(s):  
State Of The Art ◽  
The State ◽  
Allocation Problem ◽  
Buffer Allocation ◽  
Comprehensive Survey

A new method for solving buffer allocation problem in large unbalanced production lines

2019 ◽  
Vol 58 (22) ◽  
pp. 6846-6867 ◽  
Author(s):  
Shaohui Xi ◽  
Qingxin Chen ◽  
James MacGregor Smith ◽  
Ning Mao ◽  
Ailin Yu ◽  
...  
Keyword(s):  
Allocation Problem ◽  
New Method ◽  
Buffer Allocation ◽  
Production Lines

A fast algorithm for buffer allocation problem

2015 ◽  
Vol 54 (11) ◽  
pp. 3243-3255 ◽  
Author(s):  
Lei Li ◽  
YanLing Qian ◽  
Yong Min Yang ◽  
Kai Du
Keyword(s):  
Fast Algorithm ◽  
Allocation Problem ◽  
Buffer Allocation

Optimal buffer allocation in a two-stage queueing system

1993 ◽  
Vol 30 (02) ◽  
pp. 478-482
Author(s):  
Panayotis D. Sparaggis ◽  
Wei-Bo Gong
Keyword(s):  
Service Time ◽  
General Type ◽  
Optimal Allocation ◽  
Queueing System ◽  
Allocation Problem ◽  
Absolute Difference ◽  
Allocation Scheme ◽  
Buffer Allocation ◽  
Two Stage ◽  
The One

We study the buffer allocation problem in a two-stage cyclic queueing system. First, we show that transposing the number of buffers assigned to each queue does not affect the throughput. Second, we prove that the optimal buffer allocation scheme, in the sense of maximizing the system's throughput, is the one for which the absolute difference between the number of buffers, assigned to each queue, is minimized, i.e., it becomes either 0 or 1. This optimal allocation is insensitive to the general-type service-time distributions. These two distributions may be different and service times may even be correlated.

DEVS for AUTOSAR-based system deployment modeling and simulation

SIMULATION ◽  
2017 ◽  
Vol 93 (6) ◽  
pp. 489-513 ◽  
Author(s):  
Joachim Denil ◽  
Paul De Meulenaere ◽  
Serge Demeyer ◽  
Hans Vangheluwe
Keyword(s):  
Simulation Model ◽  
Fault Injection ◽  
Discrete Event ◽  
Direct Consequence ◽  
Buffer Allocation ◽  
System Specification ◽  
Subsequent Performance ◽  
Environment Model ◽  
Control Units ◽  
Trade Offs

AUTOSAR (AUTomotive Open System ARchitecture) is an open and standardized automotive software architecture, developed by automobile manufacturers, suppliers, and tool developers. Its design is a direct consequence of the increasingly important role played by software in vehicles. As design choices during the software deployment phase have a large impact on the behavior of the system, designers need to explore various trade-offs. Examples of such design choices are the mapping of software components to processors, the priorities of tasks and messages, and buffer allocation. In this paper, we evaluate the appropriateness of DEVS, the Discrete-Event System specification, for modeling and subsequent performance evaluation of AUTOSAR-based systems. Moreover, a DEVS simulation model is constructed for AUTOSAR-based electronic control units connected by a communication bus. To aid developers in evaluating a deployment solution, the simulation model is extended with co-simulation with a plant and environment model, evaluation at different levels of detail, and fault injection. Finally, we examine how the simulation model supports the relationship between the supplier and the original equipment manufacturer in the automotive industry. We demonstrate and validate our work by means of a power window case study.

Sign in / Sign up

Export Citation Format

Share Document