الصفحة 1
الصفحة 1
Network Models and Optimization : Multiobjective Genetic Algorithm Approach
Network Models and Optimization: Multiobjective Genetic Algorithm Approach extensively covers algorithms and applications, including shortest path problems, minimum cost flow problems, maximum flow problems, minimum spanning tree problems, travelling salesman and postman problems, location-allocation problems, project scheduling problems, multistage-based scheduling problems, logistics network problems, communication network problem, and network models in assembly line balancing problems, and airline fleet assignment problems.
Handbook on Scheduling : From Theory to Applications
This handbook covers not only in a unified approach the most important scheduling models and methods, it also put special emphasis to their relevance to practical situations. Many applications from industry and service operations management and case studies are described. Because the book offers some preliminaries concerning basic notions from discrete mathematics, it can also be used by beginners. As a consequence, the handbook is an indispensable source for a broad audience, ranging from researchers to practitioners, graduate and advanced undergraduate students in computer science/engineering, operations research, industrial and real-time engineering, management science, business administration, information systems, and applied mathematics curricula.
Just-in-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems
As the field of Supply Chain Management has matured, maintaining the precise flow of goods to maintain schedules (hence, minimizing inventories) on a just-in-time basis still remains as a major challenge. This problem or challenge has resulted in a fair amount of quantitative research in the area, producing an array of models and algorithms to help ensure the precise flow of components and final products into inventories to meet just-in-time requirements.The scheduling models and algorithms presented and illustrated in the book will be done so in the context of extensive use of computer systems in a "real time context.
Complex Scheduling
This book deals with such complex scheduling problems and methods to solve them. It consists of three parts: The ?rst part (Chapters 1 and 2) contains a description of basic scheduling models with applications and an introduction into discrete optimization (covering complexity, shortest path algorithms, linear programming, network ?ow algorithms and general optimization methods). In the second part (Chapter 3) resource-constrained project scheduling problems are considered. Especially, methods like constraint propagation, branch-a- bound algorithms and heuristic procedures are described. Furthermore, lower bounds and general objective functions are discussed.
