Abstract




 
   

Vol. 18, No. 4 (November 2005) 359-370   

downloaded Downloaded: 64   viewed Viewed: 1671

  MULTI-OBJECTIVE LEAD TIME CONTROL IN MULTISTAGE ASSEMBLY SYSTEMS (TECHNICAL NOTE)
 
Amir Azaron

Department of Industrial Engineering, University of Bu-Ali Sina, Hamadan, Iran.
azaron@msl.sys.hiroshima-u.ac.jp

S.M.T. Fatemi Ghomi

Department of Industrial Engineering, Amir Kabir University of Technology, Tehran, Iran.
fatemi@aut.ac.ir


 
( Received: March 14, 2004 )
 
 

Abstract    In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to be independent Poisson processes with equal rates. In each service station, there is one machine with exponentially distributed processing time, such that the service rate is controllable. The transport times between the service stations are independent random variables with exponential distributions. By applying the longest path analysis in queueing networks, we obtain the distribution function of time spend by a product in the system or the manufacturing lead time. The decision variables of the model are the number of servers in the service stations. The problem is formulated as a multi-objective optimal control problem that involves three conflicting objective functions. The objective functions are the total operating costs of the system per period (to be minimized), the average lead time (min), and the probability that the manufacturing lead time does not exceed a certain threshold (max). The goal programming method is used to solve a discrete-time approximation of the original problem.

 

Keywords    Queueing networks; Optimal control; Production; Multiple objective programming

 

References   

1. Azaron, A., Fatemi Ghomi, S. M. T., 2003. Optimal Control of Service Rates and Arrivals in Jackson Networks. European Journal of Operational Research 147, 17-31.

2. Azaron, A., Modarres, M., 2005. Distribution Function of the Shortest Path in Networks of Queues. OR Spectrum 27, 123-144.

3. Charnes, A., Cooper, W., Thompson, G., 1964. Critical Path Analysis via Chance Constrained and Stochastic Programming. Operations Research 12, 460-470.

4. Cheng, T. C. E., Gupta, M. C., 1989. Survey of Scheduling Research Involving Due Date Determination decisions. European Journal of Operational Research 38, 156-166.

5. Elmaghraby, S. E., Ferreira, A.A., Tavares, L. V., 2000. Optimal Start Time Under Stochastic Activity Durations. International Journal of Production Economics 64, 153-164.

6. Gold, H., 1998. A Markovian Single Server with Upstream Job and Downstream Demand Arrival Stream. Queueing Systems 30, 435-455.

7. Harrison, J. M., 1973. Assembly-Like Queues. Journal of Applied Probability 10, 354-367.

8. Haskose, A., Kingsman, B. G., Worthington, D., 2002. Modelling Flow and Jobbing Shops as a Queueing Network for Workload Control. International Journal of Production Economics 78, 271-285.

9. Hemachandra, N., Eedupuganti, S.K., 2003. Performance Analysis and Buffer Allocations
in Some Open Assembly Systems. Computers and Operations Research 30, 695-704.

10. Hwang, C., Masud, A., 1979. Multiple Objective Decision Making, Methods and Applications. Springer-Verlag, Berlin.

11. Kapadia, A. S., Hsi, B. P., 1978. Steady State Waiting Time in a Multicenter Job Shop. Naval Research Logistics Quarterly 25, 149-154.

12. Kerbache, L., Smith, J. M., 2000. Multi-Objective Routing within Large Scale Facilities Using Open Finite Queueing Networks. European Journal of Operational Research 121, 105-123.

13. Kulkarni, V., Adlakha, V., 1986. Markov and Markov-Regenerative PERT Networks. Operations Research 34, 769-781.

14. Lemoine, A. J., 1979. On Total Sojourn Time in Networks of Queues. Management Science 25, 1034-1035.

15. Martin, J., 1965. Distribution of the Time Through a Directed Acyclic Network. Operations Research 13, 46-66.

16. Papadopoulos, H. T., Heavey, C., 1996. Queueing Theory in Manufacturing Systems Analysis and Design: A Classification of Models for Production and Transfer Lines. European Journal of Operational Research 92, 1-27.

17. Ramachandran, S., Delen, D., 2005. Performance Analysis of a Kitting Process in Stochastic Assembly Systems. Computers and Operations Research 32, 449-463.

18. Schechner, Z., Yao, D., 1989. Decentralized Control of Service Rates in a Closed Jackson Network. IEEE Transactions On Automatic Control 34, 236-240.

19. Seidmann, A., Smith, M. L., 1981. Due Date Assignment for Production Systems. Management Science 27, 571-581.

20. Sethi, S., Thompson, G., 1981. Optimal Control Theory. Martinus Nijhoff Publishing, Boston.

21. Shanthikumar, J. G., Sumita, U., 1988. Approximations for the Time Spent in a Dynamic Job Shop with Application to Due-Date Assignment. International Journal of Production Research 26, 1329-1352.

22. Smith, J. M., Daskalaki, S., 1988. Buffer Space Allocation in Automated Assembly Lines. Operations Research 36, 343-358.

23. Song, D. P., Hicks, C., Earl, C. F., 2002. Product Due Date Assignment for Complex Assemblies. International Journal of Production Economics 76, 243-256.

24. Soroush, H. M., 1999. Sequencing and Due-Date Determination in the Stochastic Single Machine Problem with Earliness and Tardiness Costs. European Journal of Operational Research 113, 450-468.

25. Tseng, K., Hsiao, M., 1995. Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline. Operations Research 43, 89-101.

26. Vandaele, N., Boeck, L. D., Callewier, D., 2002. An Open Queueing Network for Lead Time Analysis. IIE Transactions 34, 1-9.

27. Yano, C. A., 1987. Stochastic Lead-Time in Two-Level Assembly Systems. IIE Transactions 19, 371-378.





International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir