Dynamic simulation of job shop scheduling for optimal performance

Emerald - 1995
V.Selladurai1, P.Aravindan2, S.G.Ponnambalam2, A.Gunasekaran3
1Department of Mechanical Engineering, Coimbatore Institute of Technology, Coimbatore, India
2Department of Mechanical and Production Engineering, PSG College of Technology, Coimbatore, India
3School of Computing and Information Technology, Monash University, Victoria, Australia

Tóm tắt

Deals with the dynamic scheduling problems and solutions of job shop comprising six work centres and n components. Concerns the behaviour of the system, with the arrival of urgent orders and normal orders. In a typical manufacturing system, urgent orders are scheduled for processing based on their urgency and given priority over normal orders. Describes an analysis of urgent order processing on the basis of non pre‐emptive priority and pre‐emptive resume priority over normal orders. Enumerates manufacturing system performances which had been analysed for the two most popular scheduling rules – first in first out (FIFO) and shortest processing time (SPT) – through a system simulation program. Concludes by asserting that the simulation program can be used to schedule the manufacturing system dynamically by choosing the appropriate scheduling rule to measure optimal system performance leading to higher productivity.

Từ khóa


Tài liệu tham khảo

1. Caramanis, M., “Production system design: a discrete event dynamic system and generalised Benders′ decomposition approach”, International Journal of Production Research, Vol. 25 No. 8, 1987, pp. 1223‐34.

2. Fry, T.D., Philipoom, P.R. and Markland, R.E., “Dispatching in a multistage job shop where machine capacities are unbalanced ”, International Journal of Production Research, Vol. 26No. 7, 1988, pp. 1193‐223.

3. Hastings, N.A.J. and Yeh, C.H., “Job oriented production scheduling”, European Journal of Operations Research, Vol. 47, 1990, pp. 35‐48.

4. Law, A.M. and McComas, M.G., “How to select simulation software for manufacturing applications”, Industrial Engineering, Vol. 24 No. 7, 1992, pp. 29‐35.

5. Melior, P., “A review of job shop scheduling”, Operations Research Quarterly, Vol. 17 No. 2, 1966.

6. Gupta, J. and Walvecican, A., “Sequencing of n jobs on m parallel processors ”, Opsearch, Vol. 6, 1969.

7. Elmaghraby, S.E. and Park, S.H., “Scheduling jobs on a number of identical machines”, AIIE Transactions, March 1974, pp. 1‐13.

8. Blackstone, J.H., Phillips, D.T. and Hogg, G.L., “A state‐of‐survey of despatching rules for manufacturing job shop operations”, International Journal of Production Research, Vol. 20No. 1, 1982, pp. 27‐45.

9. Karsiti, M.N., Cruz, B.J.Jr and Mulligan, J.H. Jr, “Simulation studies of multilevel dynamic job shop scheduling using heuristic dispatching rules”, Journal of Manufacturing Systems, Vol. 11 No. 5, 1992, pp. 346‐58.

10. Conway, R.W., “Priority dispatching and job lateness in a jobshop”, Journal of Industrial Engineering, Vol. 16 No. 4, 1965, pp. 228‐37.

11. Shannon, R.E., System Simulation: The Art and Science, Prentice‐Hall, Englewood Cliffs, NJ, 1975.

12. Gorden, G., The Application of GPSS V to Discrete System Simulation, Prentice‐Hall, Englewood Cliffs, NJ, 1975.

Thông tin
Thông tin xuất bản

Emerald

Thông tin tác giả