Decomposition Methods For Complex Factory Scheduling Problems
Download Decomposition Methods For Complex Factory Scheduling Problems PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Decomposition Methods For Complex Factory Scheduling Problems book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Decomposition Methods for Complex Factory Scheduling Problems
Author: Irfan M. Ovacik
language: en
Publisher: Springer Science & Business Media
Release Date: 2012-12-06
The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book.
Operations Research Proceedings 2016
This book includes a selection of refereed papers presented at the "Annual International Conference of the German Operations Research Society (OR2016)," which took place at the Helmut-Schmidt-Universität / Universität der Bundeswehr Hamburg, Germany, Aug. 30 - Sept. 2, 2016. Over 700 practitioners and academics from mathematics, computer science, business/economics, and related fields attended the conference. The scientific program included around 475 presentations on the theme Analytical Decision Making, focusing on the process of researching complex decision problems and devising effective solution methods towards better decisions. The book presents papers discussing classical mathematical optimization, statistics and simulation techniques. Such approaches are complemented by computer science methods and tools for the processing of data and the design and implementation of information systems. The book also examines recent advances in information technology, which allow big data volumes to be treated and enable real-time predictive and prescriptive business analytics to drive decisions and actions. Further, it includes problems modeled and treated under consideration of uncertainty, risk management, behavioral issues, and strategic decision situations.
Handbook of Scheduling
Researchers in management, industrial engineering, operations, and computer science have intensely studied scheduling for more than 50 years, resulting in an astounding body of knowledge in this field. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, the first handbook on scheduling, provides full coverage of the most recent and advanced topics on the subject. It assembles researchers from all relevant disciplines in order to facilitate cross-fertilization and create new scheduling insights. The book comprises six major parts, each of which breaks down into smaller chapters: · Part I introduces materials and notation, with tutorials on complexity theory and algorithms for the minimization of makespan, total completion time, dual objectives, maximum lateness, the number of late jobs, and total tardiness. · Part II is devoted to classical scheduling problems. · Part III explores scheduling models that originate in computer science, operations research, and management science. · Part IV examines scheduling problems that arise in real-time systems, focusing on meeting hard deadline constraints while maximizing machine utilization. · Part V discusses stochastic scheduling and queueing networks, highlighting jobs that are not deterministic. · Part VI covers applications, discussing scheduling problems in airline, process, and transportation industries, as well as in hospitals and educational institutions.