Scheduling preventive maintenance on a single CNC machine

Download

index.pdf

Date

2008-01-01

Author

Gürel, Sinan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

132
views

0
downloads

In this study we attempt to deal with process planning, scheduling and preventive maintenance (PM) decisions, simultaneously. The objective is to minimize the total completion time of a set of jobs on a CNC machine. During the process planning, we decide on the processing times of the jobs which are controllable (i.e. they can be easily changed) on CNC machines. Using shorter processing times (higher production rates) would result in greater deterioration of the machine, and we would need to plan more frequent PM visits to the machine, during which it would not be available. Therefore, the selected processing times determine not only the completion times but also the PM visit times. We first provide optimality properties for the joint problem. We propose a new heuristic search algorithm to determine simultaneously the processing times of the jobs, their sequence and the PM schedule.

Subject Keywords

Scheduling, Preventive maintenance, CNC machines, Total completion time, Heuristic search

URI

https://hdl.handle.net/11511/37707

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207540701487833

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Preemptive scheduling on identical parallel machines subject to deadlines Azizoğlu, Meral (2003-07-01) We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable.
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 ...
Uniform Parallel machine scheduling with family set-up times Tamer, Meral; Azizoğlu, Meral; Azizoğlu, Meral; Department of Industrial Engineering (2003) In this study, we address the scheduling problem of uniform parallel machines with family set-up times so as to minimize the total completion time. We develop a branch and jound algorithm that employs an efficient branching scheme. A bounding mechanism is jroposed to increase the efficiency of this algorithm. Our computational experiment shows hat the optimal solution is found in reasonable CPU times up to 15 jobs. Further experiments »re conducted to test the bounding mechanisms and this experiment indicat...
Working time constraints in operational fixed job scheduling Eliiyi, Deniz Tuersel; Azizoğlu, Meral (Informa UK Limited, 2010-01-01) In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs effic...
Due date and cost-based FMS loading, scheduling and tool management Turkcan, Ayten; Akturk, M. Selim; Storer, Robert H. (Informa UK Limited, 2007-03-01) In this study, we consider flexible manufacturing system loading, scheduling and tool management problems simultaneously. Our aim is to determine relevant tool management decisions, which are machining conditions selection and tool allocation, and to load and schedule parts on non-identical parallel CNC machines. The dual objectives are minimization of the manufacturing cost and total weighted tardiness. The manufacturing cost is comprised of machining and tooling costs (which are affected by machining cond...

Citation Formats

S. Gürel, “Scheduling preventive maintenance on a single CNC machine,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 6797–6821, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37707.