Biblio Discovery — Demo Discovery Service

6 results for "T. Jayanth Kumar"

Showing 1–6 · 2.12 seconds · RSS

  1. Journal Article Full text

    An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance

    T. Jayanth Kumar; M. Thangaraj

    Journal of Project Management, Vol. 8 No. 1 · 2023 · English · DOAJ Scopus

    In reality, the machines may interrupt because of the nature of deterioration of the machines. Thus, it is inevitable to perform maintenance alongside production planning. The preventive maintenance is a schedule of strategic operations that are performed prior to the failure occurring, to retain…

  2. Journal Article Full text

    Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm

    M. Veeresh; T. Jayanth Kumar; M. Thangaraj

    Journal of Project Management, Vol. 11 No. 1 · 2026 · English · DOAJ Scopus

    The Multiple Travelling Salesman Problem (MTSP) is one of the prominent combinatorial optimization problems with both theoretical interest and practical applications. However, its less-explored variants, such as the Open-Close Multiple Travelling Salesman Problem (OCMTSP), have received…

  3. Journal Article Full text

    A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs

    M. Thangaraj; T. Jayanth Kumar; KR. Nandan

    Journal of Project Management, Vol. 7 No. 4 · 2022 · English · DOAJ Scopus

    Job precedence can often be seen in various manufacturing process scenarios. For instance, in the context of flow shop scheduling, certain jobs must be processed before a specific job may be executed. Formally, this scenario is known as precedence constraint, which influences the optimal job…

  4. Journal Article Full text

    Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm

    M. Veeresh; T. Jayanth Kumar; M. Thangaraj

    Decision Science Letters, Vol. 13 No. 2 · 2024 · English · DOAJ Scopus

    The multiple travelling salesman problem (MTSP) extends the classical travelling salesman problem (TSP) by involving multiple salesman in the solution. MTSP has found widespread applications in various domains, such as transportation, robotics, and networking. Despite extensive research on MTSP and…

  5. Journal Article Full text

    Makespan optimization in recycling-integrated flow shop scheduling using a modified NEH heuristic with industrial case study

    M. Apoorva Rao; M. Thangaraj; T. Jayanth Kumar

    Journal of Project Management, Vol. 10 No. 4 · 2025 · English · DOAJ Scopus

    Recycling in manufacturing is becoming increasingly crucial as industries seek to reduce environmental impact and improve operational efficiency. Introducing recycling at the initial stages of the production process plays a critical role in minimizing material waste, conserving natural resources…

  6. Journal Article Full text

    An efficient hybrid genetic algorithm for solving truncated travelling salesman problem

    S. Purusotham; T. Jayanth Kumar; T. Vimala et al.

    Decision Science Letters, Vol. 11 No. 4 · 2022 · English · DOAJ Scopus

    This paper considers a practical truncated traveling salesman problem (TTSP), in which the salesman is only required to cover a subset of out of given cities (rather than covering all the given cities as in conventional travelling salesman problem (TSP)) with minimal traversal distance. Thus, every…