Download Free Deterministic Lot Sizing And Scheduling In Multi Stage Production Systems Book in PDF and EPUB Free Download. You can read online Deterministic Lot Sizing And Scheduling In Multi Stage Production Systems and write the review.

This book is the outcome of my research in the field of multi levellot sizing and scheduling which started in May 1993 at the Christian-Albrechts-University of Kiel (Germany). During this time I discovered more and more interesting aspects ab out this subject and I had to learn that not every promising idea can be thoroughly evaluated by one person alone. Nevertheless, I am now in the position to present some results which are supposed to be useful for future endeavors. Since April 1995 the work was done with partial support from the research project no. Dr 170/4-1 from the "Deutsche For schungsgemeinschaft" (D FG). The remaining space in this preface shaH be dedicated to those who gave me valuable support: First, let me express my deep gratitude towards my thesis ad visor Prof. Dr. Andreas Drexl. He certainly is a very outstanding advisor. Without his steady suggestions, this work would not have come that far. Despite his scarce time capacities, he never rejected proof-reading draft versions of working papers, and he was always willing to discuss new ideas - the good as weH as the bad ones. He and Prof. Dr. Gerd Hansen refereed this thesis. I am in debted to both for their assessment. I am also owing something to Dr. Knut Haase. Since we al most never had the same opinion when discussing certain lot sizing aspects, his comments and criticism gave stimulating input.
​Due to a varying product demand (changing product mix) and different production speeds, bottlenecks may shift between the stages. In that case, a simultaneous lot-sizing and scheduling of these stages is recommendable. Hence, an improved version of the General Lot-Sizing and Scheduling Problem for Multiple production Stages (GLSPMS) was developed. Moreover, several reformulation techniques were applied to this model to solve it exactly. Besides, a new meta-heuristic which combines the principles of Variable Neighborhood Decomposition Search (VNDS) and Exchange was implemented to find good solutions, even for a real-world problem case. Finally, further model extensions, e.g., for scarce setup resources, were proposed.
This thesis deals with timing and sizing decisions for production lots, and more precisely, with mathematical models to support optimal tim ing and sizing decisions. These models are called lotsizing models. They are characterized by the fact that production lots are determined based on a trade-offbetween production costs and customer service. Production costs can be categorized as basic production costs, which consist of material costs, labour costs, machine startup costs and over head costs, and inventory related costs, which include costs of capital tied up in inventory, insurances and taxes. Customer service is the capability of the firm to deliver to their clients the products in the quantity they ordered at the agreed upon time and place. The costs of realizing a certain service level are usuaIly very dif ficult to convert into money. They include costs of expediting, loss of customer goodwill, and loss of sales revenues resulting from the short age situation.
This paper treats a two-echelon inventory system. The higher echelon is a single location reffered to as the depot, which places orders for supply of a single com modity. The lower echelon consists of several points, called the retailers, which are supplied by shipments from the depot, and at which random demands for the item occur. Stocks are reviewed and decisions are made periodically. Orders and/or shipments may each require a fixed lead time before reaching their respective desti nations. Section II gives a short literature review of distribution research. Section III introduces the multi-echelon distribution system together with the underlying as sumptions and gives a description of how this problem can be viewed as a Markovian Decision Process. Section IV discusses the concept of cost modifications in a distribution context. Section V presents the test-examples together with their optimal solutions and also gives the characteristic properties of these optimal solutions. These properties then will be used in section VI to give adapted ver sions of various heuristics which were used in assembly experiments previously and which will be tested against the test-examples.
This volume contains the proceedings of an Advanced Study and Re search Institute on Theoretical Approaches to Scheduling Problems. The Institute was held in Durham, England, from July 6 to July 17, 1981. It was attended by 91 participants from fifteen different countries. The format of the Institute was somewhat unusual. The first eight of the ten available days were devoted to an Advanced Study Insti tute, with lectures on the state of the art with respect to deter ministic and stochastic scheduling models and on the interface between these two approaches. The last two days were occupied by an Advanced Research Institute, where recent results and promising directions for future research, especially in the interface area, were discussed. Altogether, 37 lectures were delivered by 24 lecturers. They have all contributed to these proceedings, the first part of which deals with the Advanced Study Institute and the second part of which covers the Advanced Research Institute. Each part is preceded by an introduction, written by the editors. While confessing to a natural bias as organizers, we believe that the Institute has been a rewarding and enjoyable event for everyone concerned. We are very grateful to all those who have contributed to its realization.
Lotsizing problems are found in every company, which produces various items on resources with scarce capacities. In general, the objective is to find production plans, which meet demand with the resources` given capacities and at minimal costs. However, there is a great variety of company-specific lotsizing problems due to the complexity of the underlying production processes. Both standard MRP-systems and modern Advanced Planning Systems fail to provide adequate solutions. Instead, they most often compute production plans, which are not feasible in practice. In this book new lotsizing models are presented for multi-stage production systems with general product structures, dynamic demand, setup times and lead times. They are extended to cover production on parallel machines. An iterative solution procedure is presented, which generates feasible production plans within seconds of computation time. Potential readership includes scholars of supply chain management and production planning, interested students in these areas as well as practitioners involved in production planning.
The fields of integer programming and combinatorial optimization continue to be areas of great vitality, with an ever increasing number of publications and journals appearing. A classified bibliography thus continues to be necessary and useful today, even more so than it did when the project, of which this is the fifth volume, was started in 1970 in the Institut fur Okonometrie und Operations Research of the University of Bonn. The pioneering first volume was compiled by Claus Kastning during the years 1970 - 1975 and appeared in 1976 as Volume 128 of the series Lecture Notes in Economics and Mathematical Systems published by the Springer Verlag. Work on the project was continued by Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and resulted in the publication of the second, third, and fourth volumes in 1978, 1982, and 1985 (Volumes 160, 197, and 243 of the above series). The present book constitutes the fifth volume of the bibliography and covers the period from autumn 1984 to the end of 1987. It contains 5864 new publications by 4480 authors and was compiled by Rabe von Randow. Its form is practically identical to that of the first four volumes, some additions having been made to the subject list.
This volume is intended to expand the dialogue and interest among both practitioners and academicians in a problem area worthy of attention by all. The concept of disaggregation admits to our current inability to solve many types of interrelated hierarchical problems simultaneously. It offers instead a sequential, iterative process as a workable and necessary procedure. The papers in this volume are selected from those presented at a Disaggregation Conference held in March, 1977 at The Ohio State University. We heartily applaud all those who participated in the conference and particularly appreci ate the cooperation of those authors whose work is published in this collection. Part A contains four papers which define the various dimensions of disaggregation. The paper by Martin Starr, which was the text of his luncheon address at the conference, provides several interesting perspectives to the problem. Although disaggregation suggests tear ing apart, as Professor Starr illustrates with his butterfly example, it also suggests a putting together or a synthesis which recognizes interrelationships and dependencies. The next paper by Lee Kra jewski and Larry Ritzman offers a general model of disaggregation for both the manufacturing and service sectors. After reading the papers in this section, as well as the papers in subsequent sections, you will identify other dimensions to hierarchical decision making which go beyond this generalized model.
This textbook provides a comprehensive modeling, reformulation and optimization approach for solving production planning and supply chain planning problems, covering topics from a basic introduction to planning systems, mixed integer programming (MIP) models and algorithms through the advanced description of mathematical results in polyhedral combinatorics required to solve these problems. Based on twenty years worth of research in which the authors have played a significant role, the book addresses real life industrial production planning problems (involving complex production structures with multiple production stages) using MIP modeling and reformulation approach. The book provides an introduction to MIP modeling and to planning systems, a unique collection of reformulation results, and an easy to use problem-solving library. This approach is demonstrated through a series of real life case studies, exercises and detailed illustrations. Review by Jakub Marecek (Computer Journal) The emphasis put on mixed integer rounding and mixing sets, heuristics in-built in general purpose integer programming solvers, as well as on decompositions and heuristics using integer programming should be praised... There is no doubt that this volume offers the present best introduction to integer programming formulations of lotsizing problems, encountered in production planning. (2007)