• search hit 92 of 284
Back to Result List

Job Sequencing and Tool Switching Problems with a Generalisation to Non-Identical Parallel Machines

  • Manufacturing tools have been dominating the manufacturing process since the 1960s. The job sequencing and tool switching problem is an NP-hard combinatorial optimization that has first been introduced in the context of flexible manufacturing systems in the late 1980s. Since then, production systems have undisputedly changed and improved but manufacturing tools still dominate manufacturing processes. Production and system operation processes are continuously adjusted and optimised to changing customer requirements. If the product variety requires an increasing number of tools for processing that exceeds the local tool magazine capacity of the manufacturing system, tool switches become necessary. Although tool changing times within a manufacturing centre or cell may nowadays be very small due to the high degree of automation, tool switching within a dynamic production environment is still a time consuming process that must be avoided. In order to minimize the total tool setup time to enhance productivity, the objectives of the basicManufacturing tools have been dominating the manufacturing process since the 1960s. The job sequencing and tool switching problem is an NP-hard combinatorial optimization that has first been introduced in the context of flexible manufacturing systems in the late 1980s. Since then, production systems have undisputedly changed and improved but manufacturing tools still dominate manufacturing processes. Production and system operation processes are continuously adjusted and optimised to changing customer requirements. If the product variety requires an increasing number of tools for processing that exceeds the local tool magazine capacity of the manufacturing system, tool switches become necessary. Although tool changing times within a manufacturing centre or cell may nowadays be very small due to the high degree of automation, tool switching within a dynamic production environment is still a time consuming process that must be avoided. In order to minimize the total tool setup time to enhance productivity, the objectives of the basic job sequencing and tool switching problem are to sequence a set of jobs and simultaneously to determine the best tool loading. Therefore, job sequencing and tool switching problems are gaining considerable attention. Several solution approaches to the standard problem and related versions of the problem exist. The first part of this dissertation assesses the current state-of-the-art of the job sequencing and tool switching problem and provides a classification scheme for literature on the job sequencing and tool switching problem and its variations. Only few authors consider generalisations of the problem because the level of complexity of extended problems is high. A general approach of the job sequencing and tool switching problem with non-identical parallel machines and sequence-dependent setup times is described in this dissertation. A novel mathematical model based on time periods is presented and analysed which can be adapted to different objective functions. The last part of this dissertation is a quantitative evaluation of fast and effective construction heuristics as well as of an iterated local search algorithm tested on a new set of benchmark instances. As such this dissertation provides a broad basis for future evaluations of solution approaches to the job sequencing and tool switching problem with non-identical parallel machines and sequence-dependent setup times as well as a basis for further generalisations of the problem like for example tool availability constraints or tool-size dependent variations.show moreshow less

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Dorothea CalmelsORCiD
URN:urn:nbn:de:bvb:739-opus4-8436
Advisor:Hans Ziegler
Document Type:Doctoral Thesis
Language:English
Year of Completion:2020
Date of Publication (online):2020/09/30
Date of first Publication:2020/09/30
Publishing Institution:Universität Passau
Granting Institution:Universität Passau, Wirtschaftswissenschaftliche Fakultät
Date of final exam:2020/09/02
Release Date:2020/09/30
Page Number:v, 103, lxxiv Seiten
Institutes:Wirtschaftswissenschaftliche Fakultät
Dewey Decimal Classification:3 Sozialwissenschaften / 33 Wirtschaft / 330 Wirtschaft
open_access (DINI-Set):open_access
Licence (German):License LogoStandardbedingung laut Einverständniserklärung