SPLIT ASSIGNMENT WITH TRANSPORTATION MODEL FOR JOB-SHOP LOADING (CASE STUDY)

Main Article Content

Khallel Ibrahim Mahmoud

Abstract

The aim of this paper, is to analyze the assignment problem in industry where the constraint of allowing to allocate only one job to each machine is relaxed. Thus, splitting the job is permitted and processed by more than one machine. The problem is demonstrated with a real life case study. We solved the problem by splitting the jobs and converting lot of jobs as well as the actual hours of each machine to Standard Machine Hours (SMH). Transportation model is also suggested to overcome the problem, and the optimum solution is obtained by using POM software

Article Details

How to Cite
“SPLIT ASSIGNMENT WITH TRANSPORTATION MODEL FOR JOB-SHOP LOADING (CASE STUDY)” (2009) Journal of Engineering, 15(2), pp. 3812–3825. doi:10.31026/j.eng.2009.02.20.
Section
Articles

How to Cite

“SPLIT ASSIGNMENT WITH TRANSPORTATION MODEL FOR JOB-SHOP LOADING (CASE STUDY)” (2009) Journal of Engineering, 15(2), pp. 3812–3825. doi:10.31026/j.eng.2009.02.20.

Publication Dates

References

 Caffrey, J. and Hitchings, G., "Makespan distributions in flow shop scheduling", International Journal of Operations & Production Management, 15(3) (1995) 50-58.

 Chan, F.T.S., Wong, T, C. and Chan, L.Y., "A genetic algorithm-based approach to machine assignment problem", International journal of production research, 43(12) (2005) 2451-2472.

 Chan, F. T. S., Wong, T. C. and Chan, L. Y., "Flexible job-shop scheduling problem under resource constraints", International Journal of Production Research, 44(11) (2006) 2071-2089.

 Gillett, B.E., Introduction to Operations Research, (Fourth Edition), Tata, Mc Graw- Hill, Ltd, New Delhi., (1985).

 Konstantin, K., Eugene, K. and Toshihide, I., Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent--Task Relationships, Journal of Global Optimization, 31(1) (2005) 17-43.

 Lockyer, K. and Bestwick. P.F., Quantitative Production Management, (First Edition), Pitman Publishing, New Zealand, Ltd., (1982).

 Nahimas, S., Production and Operations Analysis, Irwin, Boston, (1989).

 Natarajan, A.M., Balasubramani, P. and Tamilarasi, A. " Operations Research (Second Edition)", Dorling Kindersley (India) Pvt.Ltd, New Delhi., (2007).

 Russel, R.S. and Taylor III, B.W., Operations Management (Fourth Edition), Prentice Hall of India, New Delhi, (2006).

 Starr, M.K., Production and Operations Management (Second Edition), Biztantra, New Delhi, (2004).

 Taha, H.T., Operations Research: An Introduction, Eighth Edition, Pearson Prentice Hall, New Delhi, (2007).

 Torres, A.J.R. and Centeno, G. "Minimizing the number of late jobs for the permutation flowshop problem with secondary resources", Computers and Operations Research, 35(4) (2008) 1227-1249

Similar Articles

You may also start an advanced similarity search for this article.