A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon

In order to meet customer's demand, the production system should perform adequately by minimizing the disruptions that may occur in the operations. Therefore, in order to enhance the efficiency of the firm, it is necessary to establish a solid maintenance system. This study shall tackle a maint...

Full description

Saved in:
Bibliographic Details
Main Authors: Co, Debbie J., David, Wilhelm A., Mendoza, Genevie O.
Format: text
Language:English
Published: Animo Repository 1997
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/8727
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_bachelors-9372
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-93722021-08-08T03:55:17Z A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon Co, Debbie J. David, Wilhelm A. Mendoza, Genevie O. In order to meet customer's demand, the production system should perform adequately by minimizing the disruptions that may occur in the operations. Therefore, in order to enhance the efficiency of the firm, it is necessary to establish a solid maintenance system. This study shall tackle a maintenance system that incorporates a routing policy in order to minimize total processing time for each batch of products and minimize the total maintenance cost. The state of the machine returns to as good as new condition after the implementation of any of the maintenance actions. The production system in mind is identified by n sets of m different machines arranged in series that are capable of performing non-identical set of tasks. Each machine may take different duration of time to finish the processing of the tasks due to varying capacities and speeds. The finite planning time horizon considered is equal to P and is divided equally into fixed intervals of p. With constant inspection intervals, the down time for each machine does not vary as well. When a machine is being maintained, this would result to n batches waiting to be processed on the same machine at some point in time. In lieu of this situation, the proponents developed a model that represents this kind of scenario. The model seeks to determine the optimal maintenance (which machine to inspect and when to inspect the machine) and routing policy based on the performance measures, total processing time and total maintenance cost. 1997-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/8727 Bachelor's Theses English Animo Repository Scheduling (Management) Mathematical models Systems engineering Production engineering Just-in-time systems Dynamic programming Engineering
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Scheduling (Management)
Mathematical models
Systems engineering
Production engineering
Just-in-time systems
Dynamic programming
Engineering
spellingShingle Scheduling (Management)
Mathematical models
Systems engineering
Production engineering
Just-in-time systems
Dynamic programming
Engineering
Co, Debbie J.
David, Wilhelm A.
Mendoza, Genevie O.
A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon
description In order to meet customer's demand, the production system should perform adequately by minimizing the disruptions that may occur in the operations. Therefore, in order to enhance the efficiency of the firm, it is necessary to establish a solid maintenance system. This study shall tackle a maintenance system that incorporates a routing policy in order to minimize total processing time for each batch of products and minimize the total maintenance cost. The state of the machine returns to as good as new condition after the implementation of any of the maintenance actions. The production system in mind is identified by n sets of m different machines arranged in series that are capable of performing non-identical set of tasks. Each machine may take different duration of time to finish the processing of the tasks due to varying capacities and speeds. The finite planning time horizon considered is equal to P and is divided equally into fixed intervals of p. With constant inspection intervals, the down time for each machine does not vary as well. When a machine is being maintained, this would result to n batches waiting to be processed on the same machine at some point in time. In lieu of this situation, the proponents developed a model that represents this kind of scenario. The model seeks to determine the optimal maintenance (which machine to inspect and when to inspect the machine) and routing policy based on the performance measures, total processing time and total maintenance cost.
format text
author Co, Debbie J.
David, Wilhelm A.
Mendoza, Genevie O.
author_facet Co, Debbie J.
David, Wilhelm A.
Mendoza, Genevie O.
author_sort Co, Debbie J.
title A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon
title_short A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon
title_full A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon
title_fullStr A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon
title_full_unstemmed A goal programming model on the optimal maintenance and routing policy for an M X N system under a finite time horizon
title_sort goal programming model on the optimal maintenance and routing policy for an m x n system under a finite time horizon
publisher Animo Repository
publishDate 1997
url https://animorepository.dlsu.edu.ph/etd_bachelors/8727
_version_ 1772834864304750592