Algorithms/Procedures Details and Guide to Use

Transcription

1 Algorithms/Procedures Details and Guide to Use The following material appears at the website associated with this book. The details of the algorithms available at the website associated with this book are given below: 1. Abbreviation is the name by which the algorithm/procedure is named at the web-site associated with this book 2. Author name 3. Coder name 4. The type of algorithm or procedure used, e.g., evaluative/predictive or generative/optimization 5. Description of system to which the algorithm/procedure may be applied including size restrictions, if any 6. Output of the algorithm/procedure 7. Reference Only one algorithm is capable of handling open loop (unsaturated) serial production lines (EXPAN). C. T. Papadopoulos et al., Analysis and Design of Discrete Part Production Lines, Springer Optimization and Its Applications, DOI: / _9, Springer Science+Business Media, LLC

2 234 B Algorithms/Procedures Details and Guide to Use B.1 Markovian Abbreviation: MARKOV Author: Cathal Heavey, University of Limerick, Ireland Coder: Cathal Heavey Description: Given a detailed specification of a reliable or unreliable production line with single machines at each station with service and repair times distributed according to an Erlang-k (k 1) distribution and the times to failure following an exponential distribution. Intermediate buffers of finite capacity are allowed between any two successive stations of the saturated line. With current computer capabilities the algorithm is able to handle systems with up to 300,000 states/equations in reasonable time. Output: Exact throughput of the specified production line Reference: Heavey, Papadopoulos and Browne (1993) B.2 Decomposition-1 Abbreviation: DECO-1 Author: Yves Dallery (Ecole Centrale Paris) and Yannick Frein (Institut Polytechnique de Grenoble, France) Coder: Michael Vidalis (University of the Aegean, Greece) Description: The algorithm is capable of handling any size of serial single machine station reliable saturated production lines with exponential service times and intermediate buffers of finite capacity using the decomposition approach. Output: Throughput of the specified production line Reference: Dallery and Frein (1993), among other papers B.3 Expansion Abbreviation: EXPAN Author: Laoucine Kerbache and James MacGregor Smith Coder: Suchant Jain and James MacGregor Smith Description: The algorithm is capable of handling unsaturated reliable serial production lines with parallel machines at each station with finite intermediate buffers using a decomposition methodology. Output: Throughput of the specified production line Reference: Kerbache and MacGregor Smith (1987) and Jain and MacGregor Smith (1994)

3 B.5 Decomposition B.4 Aggregation Abbreviation: AGGRE Author: Jonh-Tae Lim, Semyon Meerkov and Ferudun Top Coder: Jonh-Tae Lim, Semyon Meerkov and Ferudun Top Description: The algorithm is capable of handling asymptotically reliable saturated transfer lines (with the machines having identical cycle times) of any size using the aggregation approach and involving forward and backward loops to obtain convergence. Output: Throughput of the specified transfer line Reference: Jonh-Tae Lim, Semyon Meerkov and Ferudun Top (1990) B.5 Decomposition-2 Abbreviation: DECO-2 Author: Alexandros Diamantidis (Aristotle University of Thessaloniki, Greece) Coder: Alexandros Diamantidis Description: The algorithm is capable of handling saturated long lines (with over 1000 stations in series) with exponential service times, parallel identical machines at each station and finite intermediate buffers using a decomposition methodology. Output: Throughput of the specified production line. Note 1: For the number of stations, K = 2, the algorithm gives the exact equations and numerical results of the two-station production line with parallel machines at each station. Note 2: For the number of parallel machines at each station, s i = 1, i = 1,2,...,K, the algorithm gives the same equations and numerical results as those originally developed by Gershwin (1987, 1994). Reference: Diamantidis, Papadopoulos and Heavey (2007)

4 236 B Algorithms/Procedures Details and Guide to Use B.6 Two-Level Work-Load Allocation Abbreviation: TLWLA Author: John Buzacott and George J. Shanthikumar Coder: Michael Vidalis and Alexandros Diamantidis Algorithm: Stand-alone Optimization Description: It is a self-contained algorithm which develops an approximate twolevel work-load allocation for saturated production lines with single machine reliable stations and specified identical or non-identical buffer sizes. Output: Throughput and two-level work-load approximation of the specified production line Reference: Buzacott and Shanthikumar (1993) B.7 Simulated Annealing Abbreviation: SA Author: Diomidis Spinellis (Athens University of Economics and Business) and Chrissoleon Papadopoulos (Aristotle University of Thessaloniki, Greece) Coder: Diomidis Spinellis Algorithm: Generative/Optimization Description: It is an optimizing search algorithm based on the methodology of simulated annealing which communicates with appropriate evaluative/predictive algorithm(s) to solve large production lines. Output: Work-load-, Buffer-, and Server-allocations, in single or double or triple combinations Reference: Spinellis and Papadopoulos (2000a) B.8 Genetic Algorithm Abbreviation: GA Author: Diomidis Spinellis and Chrissoleon Papadopoulos Coder: Fanis Karagiannis and Diomidis Spinellis Algorithm: Generative/Optimization Description: It is an optimizing search algorithm based on the methodology of genetic programming which communicates with appropriate evaluative/predictive algorithm(s) to solve large production lines. Output: Work-load-, Buffer-, and Server-allocations, in single or double or triple combinations Reference: Papadopoulos and Karagiannis (2001) and Spinellis and Papadopoulos (2000b)

5 References 237 B.9 Complete Enumeration Abbreviation: CE Author: Michael Vidalis and Chrissoleon Papadopoulos Coder: Michael Vidalis and Diomidis Spinellis Algorithm: Generative/Optimization Description: It is an optimizing search algorithm based on enumeration which communicates with appropriate evaluative/predictive algorithm(s) to solve only small production lines with constraints with respect to total number of buffer slots and total number of servers. Output: Buffer- and Server-allocations, in single or double combinations Reference: enumeration, CE B.10 Buffer Allocation Abbreviation: BA Author: Chrissoleon Papadopoulos and Michael Vidalis Coder: Michael Vidalis and Diomidis Spinellis Algorithm: Stand-alone optimization Description: It is a self-contained algorithm which initially specifies a near optimal buffer allocation and being directly connected to the Markovian algorithm develops via the Hooke and Jeeves search mechanism the optimal buffer allocation and the associated optimal throughput. It solves small reliable or unreliable production lines. Output: Buffer allocation and throughput of the specified production line Reference: Papadopoulos and Vidalis (2001a) The authors would be very pleased to hear from researchers or practitioners who wish to have an algorithm/procedure developed by them to be included at the website. Hopefully in time a very comprehensive set of algorithms/procedures for the analysis/design of serial production lines would become available for all to use. This could well be the first step to having at the website a set of algorithms/procedures which have been found to be of value in design and analysis of general manufacturing systems. References 1. Buzacott, J.A. and Shanthikumar, J.G. (1993), Stochastic Models of Manufacturing Systems, Prentice Hall. 2. Dallery, Y. and Frein, Y. (1993), On decomposition methods for tandem queueing networks with blocking, Operations Research, Vol. 41, No. 2, pp Diamantidis, A.C., Papadopoulos, C.T., and Heavey, C. (2007), Approximate analysis of serial flow lines with multiple parallel-machine stations, IIE Transactions, Vol. 39, issue 4, pp

6 238 B Algorithms/Procedures Details and Guide to Use 4. Gershwin, S.B. (1987), An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking, Operations Research, Vol. 35, pp Gershwin, S.B. (1994), Manufacturing Systems Engineering, Prentice Hall. 6. Heavey, C., Papadopoulos, H.T., and Browne, J. (1993), The throughput rate of multistation unreliable production lines, European Journal of Operational Research, Vol. 68, pp Jain, S. and Smith, J.M. (1994), Open finite queueing networks with M/M/C/K parallel servers, Computers & Operations Research, Vol. 21, No. 3, pp Kerbache, L. and MacGregor Smith, J. (1987), The generalized expansion method for open finite queueing networks, European Journal of Operational Research, Vol. 32, pp Lim, J.-T., Meerkov, S.M., and Top, F. (1990), Homogeneous, asymptotically reliable serial production lines: Theory and a case study, IEEE Transactions on Automatic Control, Vol. 35, No. 5, pp Papadopoulos, C.T. and Karagiannis, T.I. (2001), A genetic algorithm approach for the buffer allocation problem in unreliable production lines, International Journal of Operations and Quantitative Management, Vol. 7, No. 1, pp Papadopoulos, H.T. and Vidalis, M.I. (2001a), A heuristic algorithm for the buffer allocation in unreliable unbalanced production lines, Computers & Industrial Engineering, Vol. 41, pp Spinellis, D.D. and Papadopoulos, C.T. (2000a), A simulated annealing approach for buffer allocation in reliable production lines, Annals of Operations Research, Vol. 93, pp Spinellis, D.D. and Papadopoulos, C.T. (2000b), Stochastic algorithms for buffer allocation in reliable production lines, Mathematical Problems in Engineering, Vol. 5, pp