Kongunadu Research Journal
Vol. 8 No. 1 (2021): vol 8, Iss 1, Year 2021
Articles

Interval sequencing problem

PDF
  • Radhakrishnan S,
  • Saikeerthana D
Radhakrishnan S
Department of Mathematics, D.G. Vaishnav College (Autonomous), Chennai-600106, Tamil Nadu, India.
Saikeerthana D
Department of Mathematics, D.G. Vaishnav College (Autonomous), Chennai-600106, Tamil Nadu, India.
DOI: https://doi.org/10.26524/krj.2021.3
Published June 4, 2021
Keywords
  • Sequencing problem, Intervals, Optimal sequence, Total time elapsed, Idle time.
How to Cite
S, R., & D, S. (2021). Interval sequencing problem. Kongunadu Research Journal, 8(1), 8-21. https://doi.org/10.26524/krj.2021.3

Abstract

This paper deals with sequencing problems for ‘n’ jobs on single machine, ‘n’ jobs on two machines, ‘n’ jobs on three machines and ‘n’ jobs on ‘m’ machines. Here, we consider the sequencing problem where the processing time, due dates, weights are taken as intervals. An algorithm is provided for obtaining an optimal sequence and also for determining the minimum duration taken to complete all the jobs. To illustrate this, numerical examples are provided.

PDF

Downloads

Download data is not yet available.