Line Balancing Problem with Multi-Manned Workstations and Resource Constraints: The Case of Electronics Waste Disassembly

The increasing public awareness of environmental protection and the scarcity of rare earth elements have made closed-loop supply chains a necessity in many sectors. In particular, recycling components and parts from end-of-life consumer electronics have drawn the attention of both academics and practitioners. Disassembly line balancing improves the resource efficiency of recycling operations. This study proposes a new mathematical formulation and hybrid metaheuristics for solving the Disassembly Line Balancing Problem (DLBP) considering multi-manned workstations and resource constraints. The transformed AND/OR graph is used for prioritizing disassembly tasks in the modeling process. The method is applied for optimizing a real-world case of laptop disassembly to showcase the usefulness of the approach. The performance of the developed metaheuristics is compared to minimize the number of workstations, operators, and machines involved in the disassembly operations. Further, the results are analyzed through sensitivity analysis. This study concludes by providing practical insights and suggestions for the future development of DLBPs

Essays in Empirical Labor Economics: Evidence on Health, Education and Migration

This dissertation empirically investigates forces that shape the human capital base in the German labor market. Its three essays provide evidence on governmental interventions that promote or change the supply of human capital and impact health, education and migration, respectively

Personaneinsatz- und Tourenplanung für Mitarbeiter mit Mehrfachqualifikationen

In workforce routing and scheduling there are many applications in which differently skilled workers must perform jobs that occur at different locations, where each job requires a particular combination of skills. In many such applications, a group of workers must be sent out to provide all skills required by a job. Examples are found in maintenance operations, the construction sector, health care operations, or consultancies. In this thesis, we analyze the combined problem of composing worker groups (teams) and routing these teams under goals expressing service-, fairness-, and cost-objectives. We develop mathematical optimization models and heuristic solution methods for an integrated solution and a sequential solution of the teaming- and routing-subproblems . Computational experiments are conducted to identify the tradeoff of better solution quality and computational effort

Mathematics & Statistics 2017 APR Self-Study & Documents

UNM Mathematics & Statistics APR self-study report, review team report, response report, and initial action plan for Spring 2017, fulfilling requirements of the Higher Learning Commission

System Qualities Ontology, Tradespace and Affordability (SQOTA) Project – Phase 4

This task was proposed and established as a result of a pair of 2012 workshops sponsored by the DoD Engineered Resilient Systems technology priority area and by the SERC. The workshops focused on how best to strengthen DoD’s capabilities in dealing with its systems’ non-functional requirements, often also called system qualities, properties, levels of service, and –ilities. The term –ilities was often used during the workshops, and became the title of the resulting SERC research task: “ilities Tradespace and Affordability Project (iTAP).” As the project progressed, the term “ilities” often became a source of confusion, as in “Do your results include considerations of safety, security, resilience, etc., which don’t have “ility” in their names?” Also, as our ontology, methods, processes, and tools became of interest across the DoD and across international and standards communities, we found that the term “System Qualities” was most often used. As a result, we are changing the name of the project to “System Qualities Ontology, Tradespace, and Affordability (SQOTA).” Some of this year’s university reports still refer to the project as “iTAP.”This material is based upon work supported, in whole or in part, by the U.S. Department of Defense through the Office of the Assistant of Defense for Research and Engineering (ASD(R&E)) under Contract HQ0034-13-D-0004.This material is based upon work supported, in whole or in part, by the U.S. Department of Defense through the Office of the Assistant of Defense for Research and Engineering (ASD(R&E)) under Contract HQ0034-13-D-0004

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.Siirretty Doriast

Graduate School: Course Decriptions, 1972-73

Official publication of Cornell University V.64 1972/7