A Computational Study of the Job-shop and the Flow-shop Scheduling Problems
Author : Helena Ramalhinho Dias Lourenço
Publisher :
Page : 308 pages
File Size : 23,20 MB
Release : 1993
Category :
ISBN :
Author : Helena Ramalhinho Dias Lourenço
Publisher :
Page : 308 pages
File Size : 23,20 MB
Release : 1993
Category :
ISBN :
Author : Uday K. Chakraborty
Publisher : Springer
Page : 348 pages
File Size : 10,20 MB
Release : 2009-09-30
Category : Technology & Engineering
ISBN : 3642028365
For over fifty years now, the famous problem of flow shop and job shop scheduling has been receiving the attention of researchers in operations research, engineering, and computer science. Over the past several years, there has been a spurt of interest in computational intelligence heuristics and metaheuristics for solving this problem. This book seeks to present a study of the state of the art in this field and also directions for future research.
Author : Christian Artigues
Publisher : John Wiley & Sons
Page : 235 pages
File Size : 38,32 MB
Release : 2013-03-01
Category : Technology & Engineering
ISBN : 1118623703
This title presents a large variety of models and algorithms dedicated to the resource-constrained project scheduling problem (RCPSP), which aims at scheduling at minimal duration a set of activities subject to precedence constraints and limited resource availabilities. In the first part, the standard variant of RCPSP is presented and analyzed as a combinatorial optimization problem. Constraint programming and integer linear programming formulations are given. Relaxations based on these formulations and also on related scheduling problems are presented. Exact methods and heuristics are surveyed. Computational experiments, aiming at providing an empirical insight on the difficulty of the problem, are provided. The second part of the book focuses on several other variants of the RCPSP and on their solution methods. Each variant takes account of real-life characteristics which are not considered in the standard version, such as possible interruptions of activities, production and consumption of resources, cost-based approaches and uncertainty considerations. The last part presents industrial case studies where the RCPSP plays a central part. Applications are presented in various domains such as assembly shop and rolling ingots production scheduling, project management in information technology companies and instruction scheduling for VLIW processor architectures.
Author : Jacek Blazewicz
Publisher : Springer
Page : 839 pages
File Size : 34,77 MB
Release : 2019-04-25
Category : Business & Economics
ISBN : 3319998498
This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more, focusing on such topics as computer systems and supply chain management. Discussion includes single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling. Many applications from industry and service operations management and case studies are described. The handbook will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.
Author : Jacek Błażewicz
Publisher : Springer Science & Business Media
Page : 654 pages
File Size : 17,17 MB
Release : 2007-06-12
Category : Business & Economics
ISBN : 3540280464
This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more, focusing on such topics as computer systems and supply chain management. Discussion includes single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling. Many applications from industry and service operations management and case studies are described. The handbook will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.
Author : Michael Z. Zgurovsky
Publisher : Springer
Page : 527 pages
File Size : 41,4 MB
Release : 2018-09-24
Category : Technology & Engineering
ISBN : 3319989774
The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.
Author : Celso C. Ribeiro
Publisher : Springer Science & Business Media
Page : 647 pages
File Size : 27,59 MB
Release : 2012-12-06
Category : Computers
ISBN : 1461515076
Finding exact solutions to many combinatorial optimization problems in busi ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.
Author : Wilhelm Dangelmaier
Publisher : Springer Science & Business Media
Page : 456 pages
File Size : 31,19 MB
Release : 2010-04-12
Category : Computers
ISBN : 3642124615
Intimesofdecliningeconomicgrowth,companieshavetocontroltheircostsmore than ever to saveresources needed in the future. Regardless of the economic size of the company, the processes of production and logistics play a decisive role in stabilizing procedures and avoiding waste. Both are important cost drivers in manufacturing companies and therefore they o?er large potential savings. Pervasive networking in the last years has contributed to a hitherto unknown transparency of global markets. This harmonization opened up new possibilities of entering foreign markets for procurement and sales to the companies. The emerging global procurement strategy was understood as a chance to rethink the relocation of existing production facilities to pro?t from existing di?erences in price and performance as a resource-saving factor. Many companies tended towards a reduction of their vertical integration by outsourcing sections of their value chain. These contracted services of production result in higher transport volumes, increased complexity of supply processes and new requirements on - gistic networks. This trend of outsourcing has not stopped, but is slowing down noticeably. Additionally,thereisanincreasingproportionofcompaniesrestoring business units that were outsourced before. Reasons for turning back decisions are often to be found in missed goals. It is not unusual that important cost f- tors were disregarded in the original basis of decision-making. In the meantime many companies have realized that it is easier to achieve stability of processes and therewith a control of costs by increasing their own contribution to p- duction. Especially in times of under-utilized capacities like in the current crisis, insourcingcanbeastrategicoption.
Author : Irfan M. Ovacik
Publisher : Springer Science & Business Media
Page : 217 pages
File Size : 22,88 MB
Release : 2012-12-06
Category : Business & Economics
ISBN : 1461563291
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.
Author : S. Narayanan
Publisher : Alpha Science Int'l Ltd.
Page : 1112 pages
File Size : 41,32 MB
Release : 2006
Category : Social Science
ISBN : 9788173197925
Presents state-of-the-art research and case studies from over 150 Design & Manufacturing professionals across the globe in the areas of CAD/CAM; Product Design; Rapid Prototyping and Tooling; Manufacturing Processes; Micromachining and Miniaturisation; Mechanism and Robotics; Artificial Intelligence; and Material Handling Systems.