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

• Main Authors: Co, Debbie J., David, Wilhelm A., Mendoza, Genevie O.
• Format: text
• Language: English
• Published: Animo Repository 1997
• Subjects: Scheduling (Management); Mathematical models; Systems engineering; Production engineering; Just-in-time systems; Dynamic programming; Engineering
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/8727
• Institution: De La Salle University

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.