Computational Intelligence in Flow Shop and Job Shop Scheduling


Book Description

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.




Computational Intelligence in Flow Shop and Job Shop Scheduling


Book Description

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.




A Computational Study of Job-shop Scheduling


Book Description

Our optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10 X 10 problem of Muth and Thompson in under 7 minutes of computation time on a Sun Sparcstation 1."




Handbook on Scheduling


Book Description

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.




Evolutionary Computation in Combinatorial Optimization


Book Description

This book constitutes the refereed proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2005, held in Lausanne, Switzerland in March/April 2005. The 24 revised full papers presented were carefully reviewed and selected from 66 submissions. The papers cover evolutionary algorithms as well as related approaches like scatter search, simulated annealing, ant colony optimization, immune algorithms, variable neighborhood search, hyperheuristics, and estimation of distribution algorithms. The papers deal with representations, analysis of operators and fitness landscapes, and comparison algorithms. Among the combinatorial optimization problems studied are graph coloring, quadratic assignment, knapsack, graph matching, packing, scheduling, timetabling, lot-sizing, and the traveling salesman problem.




Handbook on Scheduling


Book Description

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.




Advanced Manufacturing and Sustainable Logistics


Book Description

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.




Decomposition Methods for Complex Factory Scheduling Problems


Book Description

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.