Abstract

This paper examines the allocation of resource to different tasks in a production company. The company produces the same kinds of goods and want to allocate m number of tasks to 50 number of machines. These machines are subject to breakdown. It is expected that the breakdown machines will be repaired and put into operation. From past records, the company estimated the profit the machines will generate from the various tasks at the first stage of the operation. Also, the company estimated the probability of breakdown of the machines for performing each of the tasks. The aim of this paper is to determine the expected maximize profit that will accrue to the company over T horizon. The profit that will accrued to the company was obtained as N4,571,100,000 after 48 weeks of operation. At the infinty horizon, the profit was obtained to be N20,491,000,000 . It was found that adequate planning, prompt and effective maintainance can enhance the profitability of the company.

Highlights

  • We consider the allocation of tasks to different machines in a production company

  • This paper examines the allocation of resource to different tasks in a production company

  • Let st be the number of machines to be allocated in period t and let α be the percentage of break down machines that are expected to join the functional ones in period t, the transformation equation for the system is given by m st st 1 1 Probability of Breakdown (Pk) xtk, t 1,T

Read more

Summary

Introduction

We consider the allocation of tasks to different machines in a production company. The company estimates the probability of breakdown of the machines allocated to each tasks. We formulate the problem as a dynamic optimization (DO). [3] described an algorithm for computing parameter values to fit linear and separable concave approximations to the value function for large-scale problems in transportation and logistics. [5] used DO for large-scale asset management problems for both single and multiple assets. [6] extended an approximate DO method to optimize the distribution operations of a company manufacturing certain products at multiple production plants and shipping to different customer locations for sales. [7] considered the allocation of buses from a single station to different routes in a transportation company in Nigeria.

Problem Formulation
The Objective and One-Period Expected Profit Function
Dynamic Programming Formulation and Optimality
E H sH
Computational Result
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call