Minimizing the Range of Lateness for n-Jobs, 3-Machines Sequencing Problem with Due Date, Transportation Times and Equivalent Job for Block of Jobs – A Heuristic Approach
Keywords:
Job blocks, Due-dates, Sequencing, Range of lateness, Optimization
Abstract
Here a heuristic approached has been developed to minimize the range of lateness in sequencing problem of n-jobs, 3-machine with due-date and equivalent job for block of jobs. The approach is based on three theorems. This paper investigates some conditions to be imposed on times transportation and processing times. Minimization of range of lateness is the criterion to find optimal sequence of jobs. A rule to determine equivalent job and its processing times for jobs in block has also been determined here. The work has been supported by a numerical example.
References
Ikram and Kanwarjit Singh, Heuristic method to minimize the rage of lateness in n-jobs, 2-machine sequencing problem, Pure and Applied Mathematika Sciences, LXVII(1-2)(2009).
Ikram and Kanwarjit Singh, Determination of equivalent job for block of jobs in two machine sequencing problem with due-date and minimization of range of lateness, Proceedings of National Conference Innovation 2007, Exploring the latest Technology Trends BBSB Engg. College, Punjab, (2007).
Ikram and Tahir Hissain, Introduction of transportation time and minimizing of range of lateness in a special class of njobs, 2-machines sequencing problem, Proceedings of National Seminar on Statistics and its applications SLIET Punjab, (2007).
Ikram and Tahir Hissain, Minimizing range of lateness on a special class of two machines sequencing problem, JISSOR, XXVII(1-4)(2006), 43-48.
P.L.Maggu and Das Ghanshian, On 2 × n sequencing problem with transportation times of jobs, PAMS, XII(1-2)(1980).
P.L.Maggu and Das Ghanshian, Equivalent jobs for job blocks in job sequencing, OPSEARCH, 14(4)(1977)
Sushil Gupta and Tapan Sen, Minimizing range of lateness on a single machine, J. Opl. Res. Soc. England, 35(9)(1984), 853-857.
Ikram and Kanwarjit Singh, Determination of equivalent job for block of jobs in two machine sequencing problem with due-date and minimization of range of lateness, Proceedings of National Conference Innovation 2007, Exploring the latest Technology Trends BBSB Engg. College, Punjab, (2007).
Ikram and Tahir Hissain, Introduction of transportation time and minimizing of range of lateness in a special class of njobs, 2-machines sequencing problem, Proceedings of National Seminar on Statistics and its applications SLIET Punjab, (2007).
Ikram and Tahir Hissain, Minimizing range of lateness on a special class of two machines sequencing problem, JISSOR, XXVII(1-4)(2006), 43-48.
P.L.Maggu and Das Ghanshian, On 2 × n sequencing problem with transportation times of jobs, PAMS, XII(1-2)(1980).
P.L.Maggu and Das Ghanshian, Equivalent jobs for job blocks in job sequencing, OPSEARCH, 14(4)(1977)
Sushil Gupta and Tapan Sen, Minimizing range of lateness on a single machine, J. Opl. Res. Soc. England, 35(9)(1984), 853-857.
How to Cite
Tripti Sharma, & Nigus Girmay. (2015). Minimizing the Range of Lateness for n-Jobs, 3-Machines Sequencing Problem with Due Date, Transportation Times and Equivalent Job for Block of Jobs – A Heuristic Approach. International Journal of Current Research in Science and Technology, 1(1), 1-7. Retrieved from https://crst.gfer.org/index.php/crst/article/view/1
Issue
Section
Articles
