Machine scheduling with preventive maintenances

Download

index.pdf

Date

2006

Author

Batun, Sakine

Metadata

Show full item record

Item Usage Stats

123
views

55
downloads

In manufacturing environments, machines are usually subject to down periods due to various reasons such as preventive maintenance activities, pre-accepted jobs and pre-known material shortages. Among these reasons, preventive maintenance, which is defined as the pre-planned maintenance activities to keep the machine in its operating state, has gained much more importance in recent years. In this thesis, we consider the single machine total flow time problem where the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a number of optimality properties together with the upper and lower bounding procedures. Using these mechanisms, we build a branch and bound algorithm to find the optimal solution of the problem. Our extensive computational study on randomly generated test instances shows that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with minor and major maintenances. We give an optimizing algorithm to find the timing of the maintenances, when the job sequence is fixed.

Subject Keywords

Production Management.

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals Korkmaz, Gediz; Kayalıgil, Sinan; Department of Industrial Engineering (2004) In this study, a single machine batch-scheduling problem with incompatible jobs and dynamic arrivals is examined. The objective function is the minimization of the total flow time of the jobs. For solving problems a case specific branch and bound algorithm with a heuristic upper bound scheme and two alternative lower bound procedures is used. An extensive computational experiment is conducted to investigate the effects of certain parameters on the computation time. For the most difficult parameter combinati...
A linear programming approach to quaity improvement project and product mix selection under inspection error and rework Şarbak, Nedret; Köksal, Gülser; Department of Industrial Engineering (2006) In this study, the effect of inspection error on the product mix and quality projects selection in a manufacturing environment where rework and inspection errors exist is examined. It is assumed that the products (items) for which rework is necessary are reprocessed at a separate work center and 100% inspection is performed for the products both after rework and processing operations. Markov chain approach is used to compute yield and rework rates. In addition, nominal-the-best type of a quality loss functi...
Single machine scheduling with preventive maintenances Batun, Sakine; Azizoğlu, Meral (Informa UK Limited, 2009-01-01) We consider the single machine total flow time problem in which the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a branch-and-bound algorithm that employs powerful optimality properties and bounding procedures. Our extensive computational studies show that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with min...
Comparison of Intelligent Classification Techniques by Practicing a Specific Technology Audit Berkol, A.; Kara, G.; Turk, A. (2016-09-08) Technology audit activities arc carried out for assessment of firms' technological requirements, capacity or management capability. The aim of these assessments is to define the weaknesses of firms and develop actions in order to improve firms' technological capacity and/or technology management capability. Generally these activities are implemented with survey questionnaires. These questionnaires can be filled by managers of firms or can be implemented as an interview by independent experts. However, evalu...
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria Ozlen, M.; Azizoğlu, Meral (Informa UK Limited, 2011-01-01) In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the follo...

Citation Formats

S. Batun, “Machine scheduling with preventive maintenances,” M.S. - Master of Science, Middle East Technical University, 2006.