Event-driven model of unreliable production lines with storageEvent-driven model of unreliable production lines with storage Peer-Reviewed Journal Publication Δημοσίευση σε Περιοδικό με Κριτές 2015-10-061988enWe have developed an event-driven algorithm for simulating a factory production line with storage. Using this algorithm, a production line, with an arbitrary number of machines each processing items at different rates and with buffers of any size, can be modeled efficiently. The algorithm is based on computing the time to the next event for each buffer and machine, where the events are: a buffer becomes full, a buffer becomes empty, a machine fails, and a machine is repaired. By collapsing the production line to exclude empty buffers that stay empty and full buffers that stay full, piece-by-piece computation is avoided. Computation time is reduced further by updating a buffer only when the input or output rate of that buffer changes or when the state of that buffer changes. An example of a line consisting of 100 machines and 99 buffers illustrates the efficiency of the model. http://creativecommons.org/licenses/by/4.0/International Journal of Production Research2671173-1182 Yannis Phillis Φιλλης Ιωαννης Caramanis, Michael C Finger Susan D'Angelo Henry Mavretic Anton Ramsden Edward Taylor & Francis Algorithm, Annealing Algorithm, Probabilistic exchange Annealing, Monte Carlo Annealing, Simulated Annealing algorithm Cooling, Statistical Exchange algorithm, Probabilistic Hill climbing, Probabilistic Monte Carlo annealing Probabilistic exchange algorithm Probabilistic hill climbing Relaxation, Stochastic Statistical cooling Stochastic relaxation simulated annealing mathematics algorithm annealing algorithm probabilistic exchange annealing monte carlo annealing simulated annealing algorithm cooling statistical exchange algorithm probabilistic hill climbing probabilistic monte carlo annealing probabilistic exchange algorithm probabilistic hill climbing relaxation stochastic statistical cooling stochastic relaxation