Reassessing tradeoffs inherent to simultaneous maintenance and production planning

Date

2012-03-01

Author

Batun, Sakine

Metadata

Show full item record

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

Item Usage Stats

205
views

0
downloads

Previous work has considered the simultaneous (as opposed to sequential) optimization of a maintenance policy and a production policy in a multi-product setting with random yield and product mix constraints. One of the sequential approaches to which the simultaneous approach is compared is a so-called first-come-first-served (FCFS) approach, i.e., an approach that generates randomized production policies that do not depend on the deterioration state of the machine. However, the model formulation for this approach does not generate policies consistent with this FCFS notion. Therefore, we present a revised FCFS model and analyze its performance using an existing experimental design. The results suggest that previous work overestimates the degree to which a FCFS approach is suboptimal, and underestimates the value of simultaneously optimizing the maintenance and production decisions. Lastly, we conduct additional experiments which suggest that the joint impact of using both simultaneous optimization and a deterioration dependent production policy is quite significant.

Subject Keywords

Management of Technology and Innovation, Management Science and Operations Research, Industrial and Manufacturing Engineering

URI

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

Journal

Production and Operations Management

DOI

https://doi.org/10.1111/j.1937-5956.2011.01250.x

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Dissimilarity maximization method for real-time routing of parts in random flexible manufacturing systems Saygin, C; Kilic, SE (Springer Science and Business Media LLC, 2004-04-01) This paper presents a dissimilarity maximization method (DMM) for real-time routing selection and compares it via simulation with typical priority rules commonly used in scheduling and control of flexible manufacturing systems (FMSs). DMM aims to reduce the congestion in the system by selecting a routing for each part among its alternative routings such that the overall dissimilarity among the selected routings is maximized. In order to evaluate the performance of DMM, a random FMS, where the product mix is...
Rebalancing the assembly lines with total squared workload and total replacement distance objectives Girit, Utku; Azizoğlu, Meral (Informa UK Limited, 2020-01-01) Assembly line balancing is an important and well recognised operations research problem. The current line balance may not stay optimal, even feasible, due to the disruptions in one or more workstations. In this study, after the disruption, we aim to rebalance the assembly line by considering the trade-off between workload balancing (fairness measure) and total replacement distance for the tasks assigned to the different workstations (stability measure). We try to generate all non-dominated objective functio...
Generating all efficient solutions of a rescheduling problem on unrelated parallel machines Ozlen, Melih; Azizoğlu, Meral (Informa UK Limited, 2009-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 stability measures. Our efficiency measure is the total flow time and stability measure is the total reassignment cost caused by the differences in the machine allocations in the initial and new schedules. We propose a branch and bound algorithm to generate all efficie...
Heuristics for operational fixed job scheduling problems with working and spread time constraints Eliiyi, Deniz Tursel; Azizoğlu, Meral (Elsevier BV, 2011-07-01) Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In this study, we consider working time and spread time constrained versions of the operational fixed job scheduling problems. The working time constraints limit the total processing load on each machine. The spread time constraints limit the time between the start of the first job and the finish of the last job on each...
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...

Citation Formats

S. Batun, “Reassessing tradeoffs inherent to simultaneous maintenance and production planning,” Production and Operations Management, pp. 396–403, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36892.