Journal Press India^®

Author Details ( * ) denotes Corresponding author

The present chapter is devoted to study a scheduling problem with two machines arranged in series with transportation time and with the concept of equivalent item for item block. In order to transport the processed job from first machine to second there is a single transport agent, which returns empty to first machine to carry next jog after processing. Further, an optimal solution has been obtained for the scheduling problem involving weighted items and breakdown interval. The proposed algorithm has been applied on a numerical problem. Keywords: Transportation Time Equivalent Item

Keywords

Transportation Time; Equivalent Item

1. R.R.P. Jackson, Queuing systems with phase-type service, O.R. Quart., 5, 1954, 109-120


2. S.M. Johnson, Optimal two-and-three stage production scheduling, Naval, Res. Log. Quart, 1, 1954, 61-68


3. R. Bellman, Mathematical aspects of scheduling theory", J. Soc. Appl. Math., 4, 1956, 168-205


4. P. L. Maggu, G. Das, On 2xn sequencing problem with transportation times of job, PAMS, 7(1-2), 1980, 1-6


5. K.R. Baker, Introduction to sequencing and scheduling, John wiley, New York, 1974


6. E.J. Coffman, Computer and job-shop scheduling theory, John Wiley, New York, 1976


7. E. Gelenbe, G. Pujolle, Introduction to queuing networks, John Wiley, Chichester, 1986


8. J. Cao, Y. Wu, Reliability analysis of a two-unit cold standby system with replaceable repair facility, Microelectron. Reliab., 29(2), 1989, 145-150


9. CH. Christov, N. Stoytcheva, Algorithms for analytical modeling of signaling system safety, Scientific Conference of Higher School of Transport Engineering, Sofia, Bulgarian, 1992, 122-132


10. D. W. Coit, J. Liu, System reliability optimization with k-out of n subsystems, Int. J. Reliab. Quality Safety Engg., 7(2), 2000, 129-142