TY - JOUR AU - S, Radhakrishnan AU - D, Saikeerthana PY - 2021/06/04 Y2 - 2024/03/28 TI - Interval sequencing problem JF - Kongunadu Research Journal JA - krj VL - 8 IS - 1 SE - Articles DO - 10.26524/krj.2021.3 UR - https://krjournal.com/index.php/krj/article/view/483 SP - 8-21 AB - 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. ER -