List of Figures. List of Tables. Preface. Foreword. 1. Basic Concepts. 2. Evolutionary Algorithm MOP Approaches. 3. MOEA Test Suites. 4. MOEA Testing and Analysis. 5. MOEA Theory and Issues. 3. MOEA Theoretical Issues. 6. Applications. 7. MOEA Parallelization. 8. Multi-Criteria Decision Making. 9. Special Topics. 10. Epilog. Appendix A: MOEA Classification and Technique Analysis. Appendix B: MOPs in the Literature. Appendix C: Ptrue & PFtrue for Selected Numeric MOPs. Appendix D: Ptrue & PFtrue for Side-Constrained MOPs. Appendix E: MOEA Software Availability. Appendix F: MOEA-Related Information. Index. References.

/pdf/evolutionary-algorithms-for-solving-multi-objective-problems-2txxk4mqci.pdf

Evolutionary algorithms for solving multi-objective problems

/pdf/sequencing-and-scheduling-algorithms-and-complexity-lnutyrr3kz.pdf

Sequencing and scheduling: algorithms and complexity

This is a survey of "Iterated Local Search", a general purpose metaheuristic for finding good solutions of combinatorial optimization problems. It is based on building a sequence of (locally optimal) solutions by: (1) perturbing the current solution; (2) applying local search to that modified solution. At a high level, the method is simple, yet it allows for a detailed use of problem-specific properties. After giving a general framework, we cover the uses of Iterated Local Search on a number of well studied problems.

/pdf/iterated-local-search-geqjq72fho.pdf

Iterated local search

A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions. Computational experiments up to 2,000 operations show that the algorithm not only finds shorter makespans than the best approximation approaches but also runs in shorter time. It solves the well-known 10 × 10 hard benchmark problem within 30 seconds on a personal computer.

A Fast Taboo Search Algorithm for the Job Shop Problem

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

In a dynamic facilities layout problem, the objective is to minimize total costs: the flow costs over a series of discrete time periods plus the rearrangement costs of changing layouts between time periods. By assuming unit department sizes, the problem is modelled as a modified quadratic assignment problem. Five algorithms are modified to include the dynamic aspects. A cutting plane algorithm found the best solutions to a series of realistic test problems, outperforming exchange, branch and bound, dynamic programming and cut tree algorithms. It was able to solve a 30-location 5-time-period problem in 200 CPU seconds.

Quadratic assignment algorithms for the dynamic layout problem

This paper provides a survey and evaluation of static flowshop scheduling rules. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are summarized. These scheduling rules are evaluated using a discrete event simulation model. The results for the simulation model are analysed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical flowshop problems.

A survey and evaluation of static flowshop scheduling heuristics

This paper presents the first part of a study of a scheduling problem where the objective is to minimize both the number of jobs late and the average flow-time. Unlike previous approaches, a weighted function of the two criteria is not utilized. Heuristics based on simulated annealing and neighborhood search are proposed with the objective of generating schedules that produce a compromise across both criteria. Simulation experiments showed that the heuristics perform well when compared to the optimal solution set for a small problem instance.

Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem

A miniload is an automated storage and retrieval system which stores small parts in bins or totes. The system consists of racks with a central aisle along which a computer controlled stacker crane travels to store and retrieve the bins. These systems are typically used in order picking applications, or in manufacturing support for the storage of tools and small parts.This paper describes a simulation model of a single aisle, single pickup and delivery location miniload system. The model can be used to predict system parameters such as dual cycles per hour, crane and operator utilization and distance traveled by the crane. One can use the model to help design a miniload system that is capable of meeting or exceeding a given number of dual cycles per hour. This can be done by varying the height and length of the aisle, crane speeds, and/or storage policies. Examples will be used to demonstrate this design capability.The simulation model is written in SIMAN (Pegden, 1985) and the data support programs in FORTRAN. All elements of the model run on an IBM PC.

/pdf/performance-analysis-of-miniload-systems-g26s0vlawi.pdf

E. Emory Enscore

Papers

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Quadratic assignment algorithms for the dynamic layout problem

A survey and evaluation of static flowshop scheduling heuristics

Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem

Performance analysis of miniload systems