Synopsis
1 Automated manufacturing.- 1.1 Introduction.- 1.2 Production planning for FMSs.- 1.2.1 What is an FMS?.- 1.2.2 The hierarchical approach.- 1.2.3 Tactical Planning.- 1.2.4 Operational planning.- 1.3 Overview of the monograph.- 2 Throughput rate optimization in the automated assembly of printed circuit boards.- 2.1 Introduction.- 2.2 Technological environment.- 2.3 The throughput rate optimization problem.- 2.4 Workload balancing.- 2.4.1 Subproblem (A).- 2.4.2 Subproblem (B).- 2.5 Scheduling of individual machines.- 2.5.1 Subproblem (C).- 2.5.2 Subproblem (D).- 2.5.3 Subproblem (E).- 2.5.4 Subproblem (F).- 2.6 An example.- 3 Approximation algorithms for three-dimensional assignment problems with triangle inequalities.- 3.1 Introduction.- 3.2 Complexity of T? and S?.- 3.3 Approximation algorithms.- 3.4 Computational results.- 4 Scheduling jobs of equal length: complexity and facets.- 4.1 Introduction.- 4.2 Complexity of SEL.- 4.3 A partial polyhedral description of SEL.- 4.4 A cutting-plane algorithm for SEL.- 5 A column generation approach to job grouping.- 5.1 Introduction.- 5.2 Lower bounds.- 5.2.1 The job grouping problem.- 5.2.2 Column generation.- 5.2.3 The generation subproblem.- 5.2.4 Computation of lower bounds via column generation.- 5.2.5 Lagrangian relaxation.- 5.2.6 Other lower bounds.- 5.3 Upper bounds.- 5.3.1 Sequential heuristics for grouping.- 5.3.2 Set covering heuristics.- 5.4 Implementation.- 5.5 Computational experiments.- 5.5.1 Generation of problem instances.- 5.5.2 Computational results.- 5.6 Summary and conclusions.- 6 The job grouping problem for flexible manufacturing systems: some extensions.- 6.1 Introduction.- 6.2 Multiple slots.- 6.2.1 The job grouping problem.- 6.2.2 Lower bounds via column generation.- 6.2.3 Other lower bounds.- 6.2.4 Upper bounds.- 6.2.5 Adjusting the column generation procedure.- 6.2.6 Computational experiments.- 6.2.7 Computational results.- 6.3 Multiple machines.- 6.3.1 The job grouping problem.- 6.3.2 Lower bounds via column generation.- 6.3.3 Other lower bounds.- 6.3.4 Upper bounds.- 6.3.5 Adjusting the column generation procedure.- 6.3.6 Computational experiments.- 6.3.7 Computational results.- 6.4 Other extensions.- 6.5 Summary and conclusions.- 7 A local search approach to job grouping.- 7.1 Introduction.- 7.2 Local search environment.- 7.2.1 Starting solution.- 7.2.2 Objective function.- 7.2.3 Neighbourhood structure.- 7.2.4 Stopping criteria.- 7.3 Local search approaches.- 7.3.1 Simple improvement approach.- 7.3.2 Tabu search approach.- 7.3.3 Simulated annealing approach.- 7.3.4 Variable-depth approach.- 7.4 Computational experiments.- 7.4.1 The dataset.- 7.4.2 Computational results.- 7.5 Summary and conclusions.- 8 Minimizing the number of tool switches on a flexible machine.- 8.1 Introduction.- 8.2 Basic results.- 8.2.1 N P-hardness results.- 8.2.2 Finding the minimum number of setups for a fixed job sequence.- 8.3 Heuristics.- 8.3.1 Traveling salesman heuristics.- 8.3.2 Block minimization heuristics.- 8.3.3 Greedy heuristics.- 8.3.4 Interval heuristic.- 8.3.5 2-Opt strategies.- 8.3.6 Load-and-Optimize strategy.- 8.4 Computational experiments.- 8.4.1 Generation of problem instances.- 8.4.2 Computational results.- 8.5 Lower bounds.- 8.5.1 Traveling salesman paths.- 8.5.2 Structures implying extra setups.- 8.5.3 Valid inequalities.- 8.5.4 Lagrangian relaxation.- Appendix: Graph-theoretic definitions.- References.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
