A Computational study on a time-sensitive multiobjective flexible job shop scheduling problem

Download

index.pdf

Date

2017

Author

Oğuzkan, Caner

Metadata

Show full item record

Item Usage Stats

136
views

66
downloads

In this thesis we focus on a time-sensitive flexible job shop scheduling problem. In time-sensitive systems, the main concern is more on the total completion time, which includes time spent during the computation-only phase and the implementation of the solution, rather than finding a solution which will take the least time to implement. However, the conventional solution approaches do not directly address the computation time. In this study, we employ a Computation-Implementation Parallezation (CIP) approach, which was originally introduced for routing problems, in order to find more time-efficient solutions in a multiobjective flexible job shop scheduling problem. This is the first study to implement the CIP approach on a multi-objective problem. Moreover, we implement the CIP approach on a problem where there are precedence relations between the operations. Therefore, our results provide a further understanding of the benefits of CIP under the tradeoff between different objectives, and also the limitations of embedding the computation time into the implementation in a more challenging problem setting. We perform extensive computational experiments on many different scenarios based on different instance sizes, flexibility of the processing tools, processing times of operations and compare a base solution method with its CIP implementation. Our results show that CIP approach can provide considerable improvement in the solution quality without increasing the computation-only time or we can find better solutions using the same computation-only time in a multiobjective flexible job shop scheduling problem.

Subject Keywords

Flextime., Production scheduling., Manufacturing processes.

URI

http://etd.lib.metu.edu.tr/upload/12621701/index.pdf
https://hdl.handle.net/11511/27027

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A heuristic approach for the single machine scheduling tardiness problems Özbakır, Saffet İlker; Kırca, Ömer; Department of Industrial Engineering (2011) In this thesis, we study the single machine scheduling problem. Our general aim is to schedule a set of jobs to the machine with a goal to minimize tardiness value. The problem is studied for two objectives: minimizing total tardiness value and minimizing total weighted tardiness value. Solving optimally this problem is difficult, because both of the total tardiness problem and total weighted tardiness problem are NP-hard problems. Therefore, we construct a heuristic procedure for this problem. Our heuristi...
Solution approaches for flexible job shop scheduling problems Balcı, Şerife Aytuğ; Azizoğlu, Meral; Oğuzsoy, Cemal Berk; Department of Industrial Engineering (2013) In this thesis, we consider a flexible job shop scheduling problem existing in discrete parts manufacturing industries. We are motivated by the production environment of Roketsan Missiles Industries Incorporation, operating at Turkish defense industry. Our objective is to minimize the total weighted completion times of the jobs in the system. We formulate the problem as a mixed integer linear program and find that our model could find optimal solutions only to small sized problem instances. For medium and l...
Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm Solyali, O.; Ozpeynirci, O. (Informa UK Limited, 2009-01-01) This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show ...
Potential Utilization of Building Information Models for Planning Maintenance Activities Akçamete Güngör, Aslı; Garrett, James H (2010-06-30) The opportunities for leveraging Building Information Models (BIMs) for facility operations are compelling and yet utilization of BIMs during building operation and maintenance is falling behind the BIM implementations for design and construction. Current studies of BIMs used for the operations phase and commercially available technologies focus on transferring information from the design and construction phases to the operations phase by enabling creation and capturing of digital facility information throu...
AN ALGORITHM FOR THE COMMITTEE CONSTRUCTION PROBLEM CEYLAN, D; SAATCIOGLU, O; SEPIL, C (Elsevier BV, 1994-08-25) This paper presents an approach to the problem of committee construction for Associate Professorship promotions. In Turkey, the promotion to the 'Associate Professor' title is centrally organized by the Interuniversity Council. The Interuniversity Council assigns an evaluation committee to each applicant. Each applicant is then examined by the committee based on his/her publications and background. The problem is, how to form juries in order to maximize the match of background of the jury members and the ca...

Citation Formats

C. Oğuzkan, “A Computational study on a time-sensitive multiobjective flexible job shop scheduling problem,” M.S. - Master of Science, Middle East Technical University, 2017.