Müller, David: Scheduling flexible job shops under workforce constraints. 2021
Inhalt
- Contents
- List of Figures
- List of Tables
- 1 Introduction and Preliminaries
- 1.1 Research Questions
- 1.2 Basics on the Flexible Job Shop Scheduling Problem
- 1.3 Contribution and Outline of the Thesis
- 2 A Worker Constrained Flexible Job Shop Scheduling Problem with Sequence-Dependent Setup Times
- 2.1 Introduction
- 2.2 Notation and Detailed Problem Description
- 2.3 Decomposition Approach
- 2.4 Decomposition Based Heuristics
- 2.5 Computational Study
- 2.6 Summary
- Bibliography
- 3 Mathematical Models for a Flexible Job Shop Scheduling Problem with Machine Operator Constraints
- 3.1 Introduction
- 3.2 Problem Description
- 3.3 Mixed-Integer Programming Model
- 3.4 Constraint Programming Model
- 3.5 Computational Study
- 3.6 Conclusion and Future Research
- Bibliography
- 4 Filter-and-Fan Approaches for Scheduling Flexible Job Shops under Workforce Constraints
- 4.1 Introduction
- 4.2 Problem Definition and Representation of Feasible Solutions
- 4.3 Constraint Programming Formulation
- 4.4 Filter-and-Fan Approaches
- 4.5 Computational Study
- 4.6 Conclusion
- Bibliography
- 5 Semiconductor Final-Test Scheduling under Setup Operator Constraints
- 5.1 Introduction and Overview
- 5.2 Detailed Problem Statement
- 5.3 Tabu Search Approach
- 5.4 Computational Study and Managerial Implications
- 5.5 Conclusion
- Bibliography
- 6 An Algorithm Selection Approach forthe Flexible Job Shop Scheduling Problem: Choosing Constraint Programming Solvers through Machine Learning
- 6.1 Introduction
- 6.2 Definition of the Flexible Job Shop Scheduling Problem
- 6.3 Performance Evaluation of Constraint Programming Solvers
- 6.4 Algorithm Selection Approaches
- 6.5 Computational Results and Evaluation
- 6.6 Summary
- Bibliography
- Chapter 7 Summary and Outlook
- Bibliography