International Journal of Innovative Research in Computer Science and Technology
Year: 2015, Volume: 3, Issue: 3
First page : ( 139) Last page : ( 142)
Online ISSN : 2350-0557.
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
LAXMI NARAIN
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.
[1] 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.
[2] J. N. D. Gupta, “m-Satge flow-shop scheduling by branch and bound”, OPSEARCH, vol. 7, 1970, pp. 37.
[3] L. Narain and P. C. Bagga “Flow-shop/no-idle scheduling to minimize mean flow-time”, ANZIAM. Journal, vol. 47, 2005, pp. 265-275.
[4] 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.
[5] 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.
[6] 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.
[7] P. C. Bagga,, “Sequencing in a rental situation”, Jr. of Canadian Operations Research Society, vol. 7, 1969, pp. 152-153.
[8] 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.
[9] 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.
[10] 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.
Associate Professor, Department of Mathematics, Acharya Narendra Dev College, University of Delhi, Delhi, India (Email: laxminarain@andc.du.ac.in )
No. of Downloads: 17 | No. of Views: 1350
Dmytro Ivanenko, Ion Petrescu, Ahmet Yilmaz, Nikolaos Papadopoulos, Arben Joe, Milos Petrovic, James Wilson.
January 2025 - Vol 13, Issue 1
Indri Dayana, Habib Satria.
July 2024 - Vol 12, Issue 4
Mohammed Faizan, Peal Desai, Rupesh Sharma, Taha Kotwal, Prof. Balwante S S.
May 2024 - Vol 12, Issue 3
