MINIMIZING RENTAL COST IN THREE-MACHINE FLOWSHOP PROBLEMS
This paper studies three-machine specially structured flow-shop problems under rental Policy III. Here under Policy III, it is considered that first machine will be taken on rent in the starting of processing the jobs; second machine will be taken on rent when the first job is completed on first machine and third machine is taken on rent when first job is completed on second machine. The objective is to obtain a sequence which minimizes the total rental cost of the machines. An algorithm is developed using Branch-and-Bound technique. The algorithm is illustrated through a numerical example.
Flow-shop scheduling, Elapsed Time, Idle Time Rental Cost
 A. H. G. Rinnooy Kan,, B. G. Lageweg and J. K. Lenstra, “Minimizing total costs in one machine scheduling”, Operations Research, vol. 23, 1975, pp. 908-927.
 J. N. D. Gupta, “m-Satge flow-shop scheduling by branch and bound”, OPSEARCH, vol. 7, 1970, pp. 37.
 L. Narain and P. C. Bagga “Flow-shop/no-idle scheduling to minimize mean flow-time”, ANZIAM. Journal, vol. 47, 2005, pp. 265-275.
 L. Narain and P. C. Bagga, “Flow-shop/no-idle scheduling to minimize total elapsed time”, Journal of Global Optimization, vol. 33, 2004, pp. 349-367.
 P. C. Bagga and Ambika Bhambani, “Minimizing rental costs in three-machine sequencing problem”, Jr. of Indian Association for Productivity, Quality and Reliability, vol. 21, 1996, pp. 73-77.
 P. C. Bagga and K. Khurana, “Minimizing waiting cost of jobs in renting situations”, Journal of Indian Association for Production, Quality and Reliability, vol. 8(3), 1983.
 P. C. Bagga,, “Sequencing in a rental situation”, Jr. of Canadian Operations Research Society, vol. 7, 1969, pp. 152-153.
 S. M. Johnson, “Optimal two and three stage production schedule with set up times included”, Naval Research Logistics Quarterly, vol. 1, 1954, pp. 61-68.
 S. S. Panwalker and A. W. Khan, “An improved branch and bound procedure for the n x m flow-shop problems”, Naval Research Logistics Quarterly, vol. 22, 1975, pp. 787-790.
 Z. A. Lomnicki, “A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem”, Operational Research Quarterly, vol. 16, 1965, pp. 89-100.
[LAXMI NARAIN (2015), MINIMIZING RENTAL COST IN THREE-MACHINE FLOWSHOP PROBLEMS, International Journal of Innovative Research in Computer Science & Technology (IJIRCST), Vol-3, Issue-3, Page No-139-142], (ISSN 2347 - 5552). www.ijircst.org
Associate Professor, Department of Mathematics, Acharya Narendra Dev College, University of Delhi, Delhi, India (Email: firstname.lastname@example.org )