Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 8.14 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)
ABSTRACT -- The present work deals with sequencing problems for ‘n’ jobs on two machines and ‘n’ jobs on ‘m’ machines. Minmin Maximax Method are provided for obtaining an optimal sequence, for determining the minimum duration taken to complete all the jobs and also for finding the minimum idle time of the given machines. The steps used for obtaining the job sequence by the Minmin Maximax Method in comparison to the Johnson's method are very simple and based on arithmetic reasoning. Also, the procedure adopted for solving the sequencing problems is easiest and involves the minimum numbers of iterations to obtain the sequence of jobs. Also, we have solved several numerical examples to show that the solutions obtained by the Minmin Maximax Method are consistent and efficient.
Keywords:
KEYWORDS: Sequencing Problems, Optimal Sequence, Idle Time, Total Elapsed Time.
Cite Article:
"A Novel Approach Solving Seqence Problem ", International Journal for Research Trends and Innovation (www.ijrti.org), ISSN:2455-2631, Vol.10, Issue 11, page no.b744-b753, November-2025, Available :http://www.ijrti.org/papers/IJRTI2511183.pdf
Downloads:
000259
ISSN:
2456-3315 | IMPACT FACTOR: 8.14 Calculated By Google Scholar| ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.14 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator