Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Resources
  3. Journals
  4. Applied Mathematics and Computational Intelligence (AMCI)
  5. A heuristic technique for finding a solution of job sequencing problem
 
Options

A heuristic technique for finding a solution of job sequencing problem

Journal
Applied Mathematics and Computational Intelligence (AMCI)
ISSN
2289-1315
Date Issued
2022-12
Author(s)
Rajpal Rajbhar
Delhi Technological University
L. N. Das
Delhi Technological University
Arun Kumar Bhardwaj
Lucknow University
DOI
https://ejournal.unimap.edu.my/index.php/amci/article/view/137/104
https://ejournal.unimap.edu.my/index.php/amci
Abstract
A finite set of sequential jobs performed through a setup machines assignment within a time-bound shift-wise manner or processing with a minimum time delay and using effectiveness process of machine sequencing order within the limited resource is called job sequencing problem. This paper proposed a heuristic technique known as a time deviation for an appropriate solution to the job sequencing problem to minimize the total minimum elapsed time and idle time in detail. We have written a process n number of sequential jobs through the m machines. Initially, we discussed the job sequencing problem for n jobs processed through two and three machines separately. We have also expanded the mentioned variables in n jobs for m machines. In conclusion, we have found the sequence of the job specification with the assigned machines. If the elapsed time for the n number of jobs process through m number of machines is known, for a more significant value of n, the final optimal assignment sequential jobs determined a listed solutionby the MATLAB programming is discussed in this paper. If the total elapsed time of machines' jobs is concerned, a relationship of pre-assigned matrix elements.
Subjects
  • Sequencing problem

  • Elapsed time

  • Sequencing time

  • A time deviation

File(s)
A Heuristic Technique For Finding A Solution Of Job Sequencing Problem.pdf (327.43 KB)
google-scholar
Views
Downloads
  • About Us
  • Contact Us
  • Policies